Ladislav Nebesky

18 papers Journal 18
YearRankTypeTitle / Venue / Authors
2013 J jnl
Guides and shortcuts in graphs.
Discret. Math.
Henry Martyn Mulder, Ladislav Nebesky
2010 J jnl
Distance-hereditary graphs and signpost systems.
Discret. Math.
Ladislav Nebesky
2009 J jnl
Axiomatic characterization of the interval function of a graph.
Eur. J. Comb.
Henry Martyn Mulder, Ladislav Nebesky
2007 J jnl
Distance defined by spanning trees in graphs.
Discuss. Math. Graph Theory
Gary Chartrand, Ladislav Nebesky, Ping Zhang
2007 J jnl
The interval function of a connected graph and road systems.
Discret. Math.
Ladislav Nebesky
2006 J jnl
Leaps: an approach to the block structure of a graph.
Discuss. Math. Graph Theory
Henry Martyn Mulder, Ladislav Nebesky
2005 J jnl
Hamiltonian colorings of graphs.
Discret. Appl. Math.
Gary Chartrand, Ladislav Nebesky, Ping Zhang
2005 J jnl
On hamiltonian colorings of graphs.
Discret. Math.
Gary Chartrand, Ladislav Nebesky, Ping Zhang
2004 J jnl
Intervals and steps in a connected graph.
Discret. Math.
Ladislav Nebesky
2004 J jnl
Radio k-colorings of paths.
Discuss. Math. Graph Theory
Gary Chartrand, Ladislav Nebesky, Ping Zhang
2003 J jnl
Greedy
Discret. Math.
Gary Chartrand, Ladislav Nebesky, Ping Zhang
2003 J jnl
Modular and median signpost systems and their underlying graphs.
Discuss. Math. Graph Theory
Henry Martyn Mulder, Ladislav Nebesky
2003 J jnl
Signpost Systems and Their Underlying Graphs.
Electron. Notes Discret. Math.
Henry Martyn Mulder, Ladislav Nebesky
2001 J jnl
The set of geodesics in a graph.
Discret. Math.
Ladislav Nebesky
1981 J jnl
Every connected, locally connected graph is upper embeddable.
J. Graph Theory
Ladislav Nebesky
1978 J jnl
Some sufficient conditions for the existence of a 1-factor.
J. Graph Theory
Ladislav Nebesky
1977 J jnl
On induced subgraphs of a block.
J. Graph Theory
Ladislav Nebesky
1971 J jnl
Left-right double trees.
Discret. Math.
Ladislav Nebesky