
Search the dblp DataBase
Martin Knor:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Martin Knor
Characterization of minorclosed pseudosurfaces. [Citation Graph (0, 0)][DBLP] Ars Comb., 1996, v:43, n:, pp: [Journal]
 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]
 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]
 Martin Knor, Ludovít Niepel
Connectivity of iterated line graphs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:125, n:23, pp:255266 [Journal]
 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:666669 [Journal]
 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:600606 [Journal]
 Martin Knor, Ludovít Niepel
Diameter in iterated path graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2001, v:233, n:13, pp:151161 [Journal]
 Martin Knor
A Note on Radially Moore Digraphs. [Citation Graph (0, 0)][DBLP] IEEE Trans. Computers, 1996, v:45, n:3, pp:381383 [Journal]
 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:171180 [Journal]
 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:1524 [Journal]
Distance Independent Domination In Iterated Line Graphs. [Citation Graph (, )][DBLP]
Domination in a digraph and in its reverse. [Citation Graph (, )][DBLP]
Regular hamiltonian embeddings of K_{n, n} and regular triangular embeddings of K_{n, n, n}. [Citation Graph (, )][DBLP]
Diameter and connectivity of 3arc graphs. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs
