On $1$-factors in the cube of a graph

Ladislav Nebeský

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

Displaying similar documents to “On $1$ -factors in the cube of a graph”

A generalization of Hamiltonian cycles for trees

Ladislav Nebeský (1976)

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.

On Decomposition of a Tree into the Minimal Number of Paths

Anton Kotzig (1967)

Matematický časopis

Similarity:

Displaying similar documents to “On 1 -factors in the cube of a graph”

A generalization of Hamiltonian cycles for trees

Extended trees of graphs

On Decomposition of a Tree into the Minimal Number of Paths

Displaying similar documents to “On $1$ -factors in the cube of a graph”