Ladislav Nebesky

Publication Activity (10 Years)

Years Active: 1971-2013
Publications (10 Years): 0

Top Topics

Series Parallel

Social Network Analysis

Graph Theoretical

Top Venues

Publications

Henry Martyn Mulder, Ladislav Nebesky
Guides and shortcuts in graphs. Discret. Math. 313 (19) (2013)
Ladislav Nebesky
Distance-hereditary graphs and signpost systems. Discret. Math. 310 (3) (2010)
Henry Martyn Mulder, Ladislav Nebesky
Axiomatic characterization of the interval function of a graph. Eur. J. Comb. 30 (5) (2009)
Ladislav Nebesky
The interval function of a connected graph and road systems. Discret. Math. 307 (16) (2007)
Gary Chartrand, Ladislav Nebesky, Ping Zhang
Distance defined by spanning trees in graphs. Discuss. Math. Graph Theory 27 (3) (2007)
Henry Martyn Mulder, Ladislav Nebesky
Leaps: an approach to the block structure of a graph. Discuss. Math. Graph Theory 26 (1) (2006)
Gary Chartrand, Ladislav Nebesky, Ping Zhang
On hamiltonian colorings of graphs. Discret. Math. 290 (2/3) (2005)
Gary Chartrand, Ladislav Nebesky, Ping Zhang
Hamiltonian colorings of graphs. Discret. Appl. Math. 146 (3) (2005)
Gary Chartrand, Ladislav Nebesky, Ping Zhang
Radio k-colorings of paths. Discuss. Math. Graph Theory 24 (1) (2004)
Ladislav Nebesky
Intervals and steps in a connected graph. Discret. Math. 286 (1-2) (2004)
Henry Martyn Mulder, Ladislav Nebesky
Signpost Systems and Their Underlying Graphs. Electron. Notes Discret. Math. 13 (2003)
Gary Chartrand, Ladislav Nebesky, Ping Zhang
-colorings of graphs. Discret. Math. 272 (1) (2003)
Henry Martyn Mulder, Ladislav Nebesky
Modular and median signpost systems and their underlying graphs. Discuss. Math. Graph Theory 23 (2) (2003)
Ladislav Nebesky
The set of geodesics in a graph. Discret. Math. 235 (1-3) (2001)
Ladislav Nebesky
Every connected, locally connected graph is upper embeddable. J. Graph Theory 5 (2) (1981)
Ladislav Nebesky
Some sufficient conditions for the existence of a 1-factor. J. Graph Theory 2 (3) (1978)
Ladislav Nebesky
On induced subgraphs of a block. J. Graph Theory 1 (1) (1977)
Ladislav Nebesky
Left-right double trees. Discret. Math. 1 (1) (1971)