Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Ladislav Nebesky
2010 – today
- 2010
[j13]Ladislav Nebesky: Distance-hereditary graphs and signpost systems. Discrete Mathematics 310(3): 527-530 (2010)
2000 – 2009
- 2009
- [j12]Henry Martyn Mulder, Ladislav Nebesky: Axiomatic characterization of the interval function of a graph. Eur. J. Comb. 30(5): 1172-1185 (2009)
- 2007
- [j11]Ladislav Nebesky: The interval function of a connected graph and road systems. Discrete Mathematics 307(16): 2067-2073 (2007)
- [j10]Gary Chartrand, Ladislav Nebesky, Ping Zhang: Distance defined by spanning trees in graphs. Discussiones Mathematicae Graph Theory 27(3): 485-506 (2007)
- 2006
- [j9]Henry Martyn Mulder, Ladislav Nebesky: Leaps: an approach to the block structure of a graph. Discussiones Mathematicae Graph Theory 26(1): 77-90 (2006)
- 2005
- [j8]Gary Chartrand, Ladislav Nebesky, Ping Zhang: Hamiltonian colorings of graphs. Discrete Applied Mathematics 146(3): 257-272 (2005)
- [j7]Gary Chartrand, Ladislav Nebesky, Ping Zhang: On hamiltonian colorings of graphs. Discrete Mathematics 290(2/3): 133-143 (2005)
- 2004
- [j6]Ladislav Nebesky: Intervals and steps in a connected graph. Discrete Mathematics 286(1-2): 151-156 (2004)
- [j5]Gary Chartrand, Ladislav Nebesky, Ping Zhang: Radio k-colorings of paths. Discussiones Mathematicae Graph Theory 24(1): 5-21 (2004)
- 2003
- [j4]Gary Chartrand, Ladislav Nebesky, Ping Zhang: Greedy F-colorings of graphs. Discrete Mathematics 272(1): 37-46 (2003)
- [j3]Henry Martyn Mulder, Ladislav Nebesky: Modular and median signpost systems and their underlying graphs. Discussiones Mathematicae Graph Theory 23(2): 309-324 (2003)
- [j2]Henry Martyn Mulder, Ladislav Nebesky: Signpost Systems and Their Underlying Graphs. Electronic Notes in Discrete Mathematics 13: 76-80 (2003)
- 2001
- [j1]
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 21:14 CET by the dblp team