 | 2009 |
|---|
| 13 |       | Ludovít Niepel,
Martin Knor:
Domination in a digraph and in its reverse.
Discrete Applied Mathematics 157(13): 2973-2977 (2009) |
| 2008 |
|---|
| 12 | | Martin Knor,
Jozef Sirán:
Regular hamiltonian embeddings of Kn, n and regular triangular embeddings of Kn, n, n.
Discrete Mathematics 308(20): 4796-4800 (2008) |
| 2006 |
|---|
| 11 |  | Martin Knor,
Ludovít Niepel:
Distance Independent Domination In Iterated Line Graphs.
Ars Comb. 79: (2006) |
| 10 | | Mike J. Grannell,
Terry S. Griggs,
Martin Knor,
Jozef Sirán:
Triangulations of orientable surfaces by complete tripartite graphs.
Discrete Mathematics 306(6): 600-606 (2006) |
| 9 | | Thomas Böhme,
Martin Knor,
Ludovít Niepel:
Linkability in iterated line graphs.
Discrete Mathematics 306(7): 666-669 (2006) |
| 8 | | Martin Knor,
Ludovít Niepel:
Iterated line graphs are maximally ordered.
Journal of Graph Theory 52(2): 171-180 (2006) |
| 2004 |
|---|
| 7 | | Martin Knor,
Ludovít Niepel:
Independence Number in Path Graphs.
Computers and Artificial Intelligence 23(2): (2004) |
| 6 | | Mike J. Grannell,
Terry S. Griggs,
Martin Knor,
Martin Skoviera:
A Steiner triple system which colors all cubic graphs.
Journal of Graph Theory 46(1): 15-24 (2004) |
| 2003 |
|---|
| 5 | | Martin Knor,
Ludovít Niepel:
Connectivity of iterated line graphs.
Discrete Applied Mathematics 125(2-3): 255-266 (2003) |
| 2001 |
|---|
| 4 | | Martin Knor,
Ludovít Niepel:
Diameter in iterated path graphs.
Discrete Mathematics 233(1-3): 151-161 (2001) |
| 1996 |
|---|
| 3 | | Martin Knor:
Characterization of minor-closed pseudosurfaces.
Ars Comb. 43: (1996) |
| 2 | | Ludovít Niepel,
Martin Knor,
Lubomír Soltés:
Distances in iterated line graphs.
Ars Comb. 43: (1996) |
| 1 | | Martin Knor:
A Note on Radially Moore Digraphs.
IEEE Trans. Computers 45(3): 381-383 (1996) |
