2007 |
9 | EE | Ludovít Niepel:
Histories in Path Graphs.
Electronic Notes in Discrete Mathematics 28: 243-250 (2007) |
2006 |
8 | | Martin Knor,
Ludovít Niepel:
Distance Independent Domination In Iterated Line Graphs.
Ars Comb. 79: (2006) |
7 | EE | Thomas Böhme,
Martin Knor,
Ludovít Niepel:
Linkability in iterated line graphs.
Discrete Mathematics 306(7): 666-669 (2006) |
6 | EE | Martin Knor,
Ludovít Niepel:
Iterated line graphs are maximally ordered.
Journal of Graph Theory 52(2): 171-180 (2006) |
2004 |
5 | | Martin Knor,
Ludovít Niepel:
Independence Number in Path Graphs.
Computers and Artificial Intelligence 23(2): (2004) |
2003 |
4 | | Martin Knor,
Ludovít Niepel:
Connectivity of iterated line graphs.
Discrete Applied Mathematics 125(2-3): 255-266 (2003) |
2001 |
3 | EE | Martin Knor,
Ludovít Niepel:
Diameter in iterated path graphs.
Discrete Mathematics 233(1-3): 151-161 (2001) |
1996 |
2 | | Ludovít Niepel,
Martin Knor,
Lubomír Soltés:
Distances in iterated line graphs.
Ars Comb. 43: (1996) |
1993 |
1 | | Vojtech Jankovic,
Eugen Ruzický,
Ludovít Niepel:
Smooth Morphological Transformation of CT and MR Medical Data.
CAIP 1993: 674-678 |