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$
AbstractThomassen conjectured that every 4-connected line graph is hamiltonian. Here we shall see th...
AbstractMotivated by the theorem of Tutte which states that each 4-connected planar graph has a Hami...
AbstractIt is shown that every connected vertex-transitive graph of order 4p, where p is a prime, is...
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: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 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...
[[abstract]]Let G be a graph. For a positive integer k, the k-th power Gk of G is the graph having t...
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...
AbstractThe square of a graph is obtained by adding additional edges joining all pairs of vertices w...
Let G=(V, E) be a 2-connected graph. We call two vertices u and v of G a K4-pair if u and v are the ...
AbstractIn 1956, W.T. Tutte proved that every 4-connected planar graph is hamiltonian. Moreover, in ...
AbstractThomassen conjectured that every 4-connected line graph is hamiltonian. Here we shall see th...
AbstractMotivated by the theorem of Tutte which states that each 4-connected planar graph has a Hami...
AbstractIt is shown that every connected vertex-transitive graph of order 4p, where p is a prime, is...
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: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 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...
[[abstract]]Let G be a graph. For a positive integer k, the k-th power Gk of G is the graph having t...
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...
AbstractThe square of a graph is obtained by adding additional edges joining all pairs of vertices w...
Let G=(V, E) be a 2-connected graph. We call two vertices u and v of G a K4-pair if u and v are the ...
AbstractIn 1956, W.T. Tutte proved that every 4-connected planar graph is hamiltonian. Moreover, in ...
AbstractThomassen conjectured that every 4-connected line graph is hamiltonian. Here we shall see th...
AbstractMotivated by the theorem of Tutte which states that each 4-connected planar graph has a Hami...
AbstractIt is shown that every connected vertex-transitive graph of order 4p, where p is a prime, is...
DOI
Add to ORKG