EUDML

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

Currently displaying 1 – 7 of 7

Order by Relevance | Title | Year of publication

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

Elena Wisztová — 1991

Mathematica Bohemica

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

Hamiltonian connectedness and a matching in powers of connected graphs

Elena Wisztová — 1995

Mathematica Bohemica

In this paper the following results are proved: 1. Let $P_{n}$ be a path with $n$ vertices, where $n \geq 5$ and $n \neq 7, 8$ . Let $M$ be a matching in $P_{n}$ . Then ${(P_{n})}^{4} - M$ is hamiltonian-connected. 2. Let $G$ be a connected graph of order $p \geq 5$ , and let $M$ be a matching in $G$ . Then $G^{5} - M$ is hamiltonian-connected.

Page 1

Download Results (CSV)

Advanced Search

Formula preview

Currently displaying 1 – 7 of 7

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

Hamiltonian connectedness and a matching in powers of connected graphs

Existence of $n$ -factors in powers of connected graphs

Paths in powers of graph

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

Regular factors in powers of connected graphs

Two edge-disjoint Hamiltonian cycles of powers of a graph

Advanced Search

Formula preview

Currently displaying 1 – 7 of 7

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

Hamiltonian connectedness and a matching in powers of connected graphs

Existence of n -factors in powers of connected graphs

Paths in powers of graph

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

Regular factors in powers of connected graphs

Two edge-disjoint Hamiltonian cycles of powers of a graph

Existence of $n$ -factors in powers of connected graphs

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