On a Hamiltonian cycle of the fourth power of a connected graph

Elena Wisztová

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

Displaying similar documents to “On a Hamiltonian cycle of the fourth power of a connected graph”

A matching and a Hamiltonian cycle of the fourth power of a connected graph

Ladislav Nebeský (1993)

Mathematica Bohemica

Similarity:

The following result is proved: Let $G$ be a connected graph of order $g e q 4$ . Then for every matching $M$ in $G^{4}$ there exists a hamiltonian cycle $C$ of $G^{4}$ such that $E (C) ⋂ M = 0$ .

A Hamiltonian cycle and a $1$ -factor in the fourth power of a graph

Elena Wisztová (1985)

Časopis pro pěstování matematiky

Similarity:

On the line graph of the square and the square of the line graph of a connected graph

Ladislav Nebeský (1973)

Časopis pro pěstování matematiky

Similarity:

Displaying similar documents to “On a Hamiltonian cycle of the fourth power of a connected graph”

A matching and a Hamiltonian cycle of the fourth power of a connected graph

A Hamiltonian cycle and a 1 -factor in the fourth power of a graph

On the line graph of the square and the square of the line graph of a connected graph

A Hamiltonian cycle and a $1$ -factor in the fourth power of a graph