Two edge-disjoint Hamiltonian cycles of powers of a graph

Ladislav Nebeský; Elena Wisztová

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

Displaying similar documents to “Two edge-disjoint Hamiltonian cycles of powers of a graph”

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

Elena Wisztová (1985)

Časopis pro pěstování matematiky

Similarity:

A generalization of Hamiltonian cycles for trees

Ladislav Nebeský (1976)

Czechoslovak Mathematical Journal

Similarity:

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

Elena Wisztová (1991)

Mathematica Bohemica

Similarity:

In this paper the following theorem is proved: Let $G$ be a connected graph of order $p \geq 4$ and let $M$ be a matching in $G$ . Then there exists a hamiltonian cycle $C$ of $G^{4}$ such that $E (C) ⋂ M = 0$ .

Measures of traceability in graphs.

Saenpholphat, Varaporn, Okamoto, Futaba, Zhang, Ping (2006)

Mathematica Bohemica

Similarity:

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$ .

Displaying similar documents to “Two edge-disjoint Hamiltonian cycles of powers of a graph”

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

A generalization of Hamiltonian cycles for trees

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

Measures of traceability in graphs.

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