Minimum vertex ranking spanning tree problem for chordal and proper interval graphs

Dariusz Dereniowski

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

The search session has expired. Please query the service again.

Displaying similar documents to “Minimum vertex ranking spanning tree problem for chordal and proper interval graphs”

Partitionability of trees

Bohdan Zelinka (1988)

Czechoslovak Mathematical Journal

Similarity:

Extended trees of graphs

Bohdan Zelinka (1994)

Mathematica Bohemica

Similarity:

An extended tree of a graph is a certain analogue of spanning tree. It is defined by means of vertex splitting. The properties of these trees are studied, mainly for complete graphs.

The number of isomorphism classes of spanning trees of a graph

Bohdan Zelinka (1978)

Mathematica Slovaca

Similarity:

On tree-complete graphs

Ladislav Nebeský (1975)

Časopis pro pěstování matematiky

Similarity: