E-LIB Suche - Ergebnisse für: Nebeský, Ladislav

1

Guides and shortcuts in graphs:

Mulder, Henry Martyn ; Nebeský, Ladislav
Discrete Mathematics. 313 (2013) 19 - p. 1897-1907 , 2013

Link: https://doi.org/10.1016/..

2

Distance-hereditary graphs and signpost systems:

Nebeský, Ladislav
Discrete Mathematics. 310 (2010) 3 - p. 527-530 , 2010

Link: https://doi.org/10.1016/..

3

Axiomatic characterization of the interval function of a gr..:

Mulder, Henry Martyn ; Nebeský, Ladislav
European Journal of Combinatorics. 30 (2009) 5 - p. 1172-1185 , 2009

Link: https://doi.org/10.1016/..

4

On the distance function of a connected graph:

Nebeský, Ladislav
Czechoslovak Mathematical Journal. 58 (2008) 4 - p. 1101-1106 , 2008

Link: https://doi.org/10.1007/..

5

The interval function of a connected graph and road systems:

Nebeský, Ladislav
Discrete Mathematics. 307 (2007) 16 - p. 2067-2073 , 2007

Link: https://doi.org/10.1016/..

6

A new approach to chordal graphs:

Nebeský, Ladislav
Czechoslovak Mathematical Journal. 57 (2007) 1 - p. 465-471 , 2007

Link: https://doi.org/10.1007/..

7

The hamiltonian chromatic number of a connected graph witho..:

Nebeský, Ladislav
Czechoslovak Mathematical Journal. 56 (2006) 2 - p. 317-338 , 2006

Link: https://doi.org/10.1007/..

8

Travel groupoids:

Nebeský, Ladislav
Czechoslovak Mathematical Journal. 56 (2006) 2 - p. 659-675 , 2006

Link: https://doi.org/10.1007/..

9

Signpost systems and spanning trees of graphs:

Nebeský, Ladislav
Czechoslovak Mathematical Journal. 56 (2006) 3 - p. 885-893 , 2006

Link: https://doi.org/10.1007/..

10

Hamiltonian colorings of graphs:

Chartrand, Gary ; Nebeský, Ladislav ; Zhang, Ping
Discrete Applied Mathematics. 146 (2005) 3 - p. 257-272 , 2005

Link: https://doi.org/10.1016/..

11

On hamiltonian colorings of graphs:

Chartrand, Gary ; Nebesky, Ladislav ; Zhang, Ping
Discrete Mathematics. 290 (2005) 2-3 - p. 133-143 , 2005

Link: https://doi.org/10.1016/..

12

On signpost systems and connected graphs:

Nebesky, Ladislav
Czechoslovak Mathematical Journal. 55 (2005) 2 - p. 283-293 , 2005

Link: https://doi.org/10.1007/..

13

On Properties of a Graph that Depend on its Distance Functi..:

Nebeský, Ladislav
Czechoslovak Mathematical Journal. 54 (2004) 2 - p. 445-456 , 2004

Link: https://doi.org/10.1023/..

14

The Directed Geodetic Structure of a Strong Digraph:

Nebeský, Ladislav
Czechoslovak Mathematical Journal. 54 (2004) 1 - p. 1-8 , 2004

Link: https://doi.org/10.1023/..

15

Intervals and steps in a connected graph:

Nebeský, Ladislav
Discrete Mathematics. 286 (2004) 1-2 - p. 151-156 , 2004

Link: https://doi.org/10.1016/..