The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Martin Knor: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Martin Knor
    Characterization of minor-closed pseudosurfaces. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1996, v:43, n:, pp:- [Journal]
  2. Ludovít Niepel, Martin Knor, Lubomír Soltés
    Distances in iterated line graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1996, v:43, n:, pp:- [Journal]
  3. Martin Knor, Ludovít Niepel
    Independence Number in Path Graphs. [Citation Graph (0, 0)][DBLP]
    Computers and Artificial Intelligence, 2004, v:23, n:2, pp:- [Journal]
  4. Martin Knor, Ludovít Niepel
    Connectivity of iterated line graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:125, n:2-3, pp:255-266 [Journal]
  5. Thomas Böhme, Martin Knor, Ludovít Niepel
    Linkability in iterated line graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:7, pp:666-669 [Journal]
  6. Mike J. Grannell, Terry S. Griggs, Martin Knor, Jozef Sirán
    Triangulations of orientable surfaces by complete tripartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:6, pp:600-606 [Journal]
  7. Martin Knor, Ludovít Niepel
    Diameter in iterated path graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:233, n:1-3, pp:151-161 [Journal]
  8. Martin Knor
    A Note on Radially Moore Digraphs. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1996, v:45, n:3, pp:381-383 [Journal]
  9. Martin Knor, Ludovít Niepel
    Iterated line graphs are maximally ordered. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:52, n:2, pp:171-180 [Journal]
  10. Mike J. Grannell, Terry S. Griggs, Martin Knor, Martin Skoviera
    A Steiner triple system which colors all cubic graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:46, n:1, pp:15-24 [Journal]

  11. Distance Independent Domination In Iterated Line Graphs. [Citation Graph (, )][DBLP]


  12. Domination in a digraph and in its reverse. [Citation Graph (, )][DBLP]


  13. Regular hamiltonian embeddings of Kn, n and regular triangular embeddings of Kn, n, n. [Citation Graph (, )][DBLP]


  14. Diameter and connectivity of 3-arc graphs. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002