Ladislav Nebesky - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 18 from 18

2013

Guides and shortcuts in graphsHenry Martyn Mulder, Ladislav Nebesky. DM, 313(19):1897-1907, 2013. [doi]

2010

Distance-hereditary graphs and signpost systemsLadislav Nebesky. DM, 310(3):527-530, 2010. [doi]

2009

Axiomatic characterization of the interval function of a graphHenry Martyn Mulder, Ladislav Nebesky. ejc, 30(5):1172-1185, 2009. [doi]

2007

Distance defined by spanning trees in graphsGary Chartrand, Ladislav Nebesky, Ping Zhang 0004. dmgt, 27(3):485-506, 2007. [doi]

The interval function of a connected graph and road systemsLadislav Nebesky. DM, 307(16):2067-2073, 2007. [doi]

2006

Leaps: an approach to the block structure of a graphHenry Martyn Mulder, Ladislav Nebesky. dmgt, 26(1):77-90, 2006. [doi]

2005

On hamiltonian colorings of graphsGary Chartrand, Ladislav Nebesky, Ping Zhang. DM, 290(2/3):133-143, 2005. [doi]

Hamiltonian colorings of graphsGary Chartrand, Ladislav Nebesky, Ping Zhang. DAM, 146(3):257-272, 2005. [doi]

2004

Radio k-colorings of pathsGary Chartrand, Ladislav Nebesky, Ping Zhang 0004. dmgt, 24(1):5-21, 2004. [doi]

Intervals and steps in a connected graphLadislav Nebesky. DM, 286(1-2):151-156, 2004. [doi]

2003

Greedy ::::F::::-colorings of graphsGary Chartrand, Ladislav Nebesky, Ping Zhang. DM, 272(1):37-46, 2003. [doi]

Signpost Systems and Their Underlying GraphsHenry Martyn Mulder, Ladislav Nebesky. endm, 13:76-80, 2003. [doi]

Modular and median signpost systems and their underlying graphsHenry Martyn Mulder, Ladislav Nebesky. dmgt, 23(2):309-324, 2003. [doi]

2001

The set of geodesics in a graphLadislav Nebesky. DM, 235(1-3):323-326, 2001. [doi]

1981

Every connected, locally connected graph is upper embeddableLadislav Nebesky. jgt, 5(2):205-207, 1981. [doi]

1978

Some sufficient conditions for the existence of a 1-factorLadislav Nebesky. jgt, 2(3):251-255, 1978. [doi]

1977

On induced subgraphs of a blockLadislav Nebesky. jgt, 1(1):69-74, 1977. [doi]

1971

Left-right double treesLadislav Nebesky. DM, 1(1):73-81, 1971. [doi]

Sign in or sign up to see more results.

runs on WebDSL