summary: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)\bigcap M=0$
[[abstract]]Let G be a graph. For a positive integer k, the k-th power Gk of G is the graph having t...
AbstractThomassen conjectured that every 4-connected line graph is hamiltonian. Here we shall see th...
A graph G is Hamiltonian if it has a spanning cycle. The problem of determining if a graph is Hamilt...
summary:In this paper the following theorem is proved: Let $G$ be a connected graph of order $p\geq ...
summary:The following result is proved: Let $G$ be a connected graph of order $geq 4$. Then for ever...
summary:The following result is proved: Let $G$ be a connected graph of order $geq 4$. Then for ever...
summary:In this paper the following results are proved: 1. Let $P_n$ be a path with $n$ vertices, wh...
summary:In this paper the following results are proved: 1. Let $P_n$ be a path with $n$ vertices, wh...
summary:The following result is proved: Let $G$ be a connected graph of order $geq 4$. Then for ever...
summary:In this paper the following theorem is proved: Let $G$ be a connected graph of order $p\geq ...
summary:In this paper the following results are proved: 1. Let $P_n$ be a path with $n$ vertices, wh...
AbstractUsing the property that being s-edge-Hamiltonian is (n+s)-stable, we characterize all 3-conn...
In this paper we prove that if G is a (k + 2)-connected graph on n > 3 vertices satisfying P(n + ...
AbstractLet G(itk, p) denote the class of k-partite graphs, where each part is a stable set of cardi...
The aim of this paper is to prove that if s > 1 and G is a graph of order n > 4s + 6 satisfyin...
[[abstract]]Let G be a graph. For a positive integer k, the k-th power Gk of G is the graph having t...
AbstractThomassen conjectured that every 4-connected line graph is hamiltonian. Here we shall see th...
A graph G is Hamiltonian if it has a spanning cycle. The problem of determining if a graph is Hamilt...
summary:In this paper the following theorem is proved: Let $G$ be a connected graph of order $p\geq ...
summary:The following result is proved: Let $G$ be a connected graph of order $geq 4$. Then for ever...
summary:The following result is proved: Let $G$ be a connected graph of order $geq 4$. Then for ever...
summary:In this paper the following results are proved: 1. Let $P_n$ be a path with $n$ vertices, wh...
summary:In this paper the following results are proved: 1. Let $P_n$ be a path with $n$ vertices, wh...
summary:The following result is proved: Let $G$ be a connected graph of order $geq 4$. Then for ever...
summary:In this paper the following theorem is proved: Let $G$ be a connected graph of order $p\geq ...
summary:In this paper the following results are proved: 1. Let $P_n$ be a path with $n$ vertices, wh...
AbstractUsing the property that being s-edge-Hamiltonian is (n+s)-stable, we characterize all 3-conn...
In this paper we prove that if G is a (k + 2)-connected graph on n > 3 vertices satisfying P(n + ...
AbstractLet G(itk, p) denote the class of k-partite graphs, where each part is a stable set of cardi...
The aim of this paper is to prove that if s > 1 and G is a graph of order n > 4s + 6 satisfyin...
[[abstract]]Let G be a graph. For a positive integer k, the k-th power Gk of G is the graph having t...
AbstractThomassen conjectured that every 4-connected line graph is hamiltonian. Here we shall see th...
A graph G is Hamiltonian if it has a spanning cycle. The problem of determining if a graph is Hamilt...
DOI
Add to ORKG