Add to ORKGA digraph is k-traceable if each of its induced subdigraphs of order k is traceable. The Traceability Conjecture is that for k ≥ 2 every k-traceable oriented graph of order at least 2k − 1 is traceable. The conjecture has been proved for k ≤ 5. We prove that it also holds for k = 6
summary:For a nontrivial connected graph $G$ of order $n$ and a linear ordering $s\: v_1, v_2, \ldot...
If G is a claw-free graph of sufficiently large order n, satisfying a degree condition σₖ > n + k² -...
A graph is called traceable if it contains a Hamilton path, i.e., a path containing all its vertices...
A digraph is k-traceable if each of its induced subdigraphs of order k is traceable. The Traceabilit...
Graphs and AlgorithmsA digraph is k-traceable if each of its induced subdigraphs of order k is trace...
AbstractA digraph of order at least k is k-traceable if each of its subdigraphs of order k is tracea...
A digraph D is traceable if it contains a path visiting every vertex, and hypotrace- able if D is n...
A graph or digraph is hamiltonian if it contains a cycle that visits every vertex, and traceable if ...
AbstractA digraph of order at least k is termed k-traceable if each of its subdigraphs of order k is...
A digraph is \emph{traceable} if it has a path that visits every vertex. A digraph $D$ is \emph{hypo...
AbstractA digraph of order n is hypotraceable if it is nontraceable but all its induced subdigraphs ...
Let G be a graph. A Hamilton path in G is a path containing every vertex of G. The graph G is trace...
AbstractWe prove that a 2-connected graph G of order p is traceable if |N(u)∪N(v)| − |N(w)∪N(x)| ⩾ p...
AbstractA graph G is traceable if there is a path passing through all the vertices of G. It is prove...
AbstractThe work in this paper extends and generalizes earlier work by Ore on arbitrarily traceable ...
summary:For a nontrivial connected graph $G$ of order $n$ and a linear ordering $s\: v_1, v_2, \ldot...
If G is a claw-free graph of sufficiently large order n, satisfying a degree condition σₖ > n + k² -...
A graph is called traceable if it contains a Hamilton path, i.e., a path containing all its vertices...
A digraph is k-traceable if each of its induced subdigraphs of order k is traceable. The Traceabilit...
Graphs and AlgorithmsA digraph is k-traceable if each of its induced subdigraphs of order k is trace...
AbstractA digraph of order at least k is k-traceable if each of its subdigraphs of order k is tracea...
A digraph D is traceable if it contains a path visiting every vertex, and hypotrace- able if D is n...
A graph or digraph is hamiltonian if it contains a cycle that visits every vertex, and traceable if ...
AbstractA digraph of order at least k is termed k-traceable if each of its subdigraphs of order k is...
A digraph is \emph{traceable} if it has a path that visits every vertex. A digraph $D$ is \emph{hypo...
AbstractA digraph of order n is hypotraceable if it is nontraceable but all its induced subdigraphs ...
Let G be a graph. A Hamilton path in G is a path containing every vertex of G. The graph G is trace...
AbstractWe prove that a 2-connected graph G of order p is traceable if |N(u)∪N(v)| − |N(w)∪N(x)| ⩾ p...
AbstractA graph G is traceable if there is a path passing through all the vertices of G. It is prove...
AbstractThe work in this paper extends and generalizes earlier work by Ore on arbitrarily traceable ...
summary:For a nontrivial connected graph $G$ of order $n$ and a linear ordering $s\: v_1, v_2, \ldot...
If G is a claw-free graph of sufficiently large order n, satisfying a degree condition σₖ > n + k² -...
A graph is called traceable if it contains a Hamilton path, i.e., a path containing all its vertices...