Ladislav Nebeský

Discret. Math., 2013

2010

Distance-hereditary graphs and signpost systems.

[BibT_eX]

[DOI]

Discret. Math., 2010

2009

Axiomatic characterization of the interval function of a graph.

[BibT_eX]

[DOI]

Eur. J. Comb., 2009

2007

Distance defined by spanning trees in graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2007

The interval function of a connected graph and road systems.

[BibT_eX]

[DOI]

Discret. Math., 2007

2006

Leaps: an approach to the block structure of a graph.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2006

2005

Hamiltonian colorings of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

2004

Radio k-colorings of paths.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2004

Intervals and steps in a connected graph.

[BibT_eX]

[DOI]

Discret. Math., 2004

2003

Signpost Systems and Their Underlying Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2003

Modular and median signpost systems and their underlying graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2003

Greedy <i>F</i>-colorings of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2003

2001

The set of geodesics in a graph.

[BibT_eX]

[DOI]

Discret. Math., 2001

1981

Every connected, locally connected graph is upper embeddable.

[BibT_eX]

[DOI]

J. Graph Theory, 1981

1978

Some sufficient conditions for the existence of a 1-factor.

[BibT_eX]

[DOI]

J. Graph Theory, 1978

1977

On induced subgraphs of a block.

[BibT_eX]

[DOI]

J. Graph Theory, 1977

1973

An outerplanar test of linguistic projectivity.

[BibT_eX]

[DOI]

Ladislav Nebeský

Kybernetika, 1973

1972

A planar test of linguistic projectivity.

[BibT_eX]

[DOI]

Ladislav Nebeský

Kybernetika, 1972

1971

On one of the boundaries of the constituent conception of grammar.

[BibT_eX]

[DOI]

Ladislav Nebeský

Kybernetika, 1971

Left-right double trees.

[BibT_eX]

[DOI]