
A digraph of order at least \(k\) is said to be \(k\)-traceable if each of its sub-digraphs of order \(k\) is traceable. The paper presents some results pertaining to various cycle properties of strong \(k\)-traceable oriented graphs and investigates the extent to which pancyclicity is retained by strong \(k\)-traceable oriented graphs. In addition, it establishes an upper bound on the order of \(k\)-traceable oriented graphs having a strong component with girth greater than 3. It is also shown that the Path Partition Conjecture holds for 1-deficient oriented graphs having a strong component with girth at least 6.
oriented graph, Directed graphs (digraphs), tournaments, tournament, pancyclic digraph, \(k\)-traceable, k-traceable, path partition conjecture, Traceability Conjecture, Oriented graph, Tournament, Pancyclic digraph, Path Partition Conjecture, Paths and cycles, traceability conjecture
oriented graph, Directed graphs (digraphs), tournaments, tournament, pancyclic digraph, \(k\)-traceable, k-traceable, path partition conjecture, Traceability Conjecture, Oriented graph, Tournament, Pancyclic digraph, Path Partition Conjecture, Paths and cycles, traceability conjecture
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
