Cycles in \(k\)-traceable oriented graphs (Q641171)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5961715
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cycles in \(k\)-traceable oriented graphs |
scientific article; zbMATH DE number 5961715 |
Statements
Cycles in \(k\)-traceable oriented graphs (English)
0 references
21 October 2011
0 references
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.
0 references
oriented graph
0 references
tournament
0 references
pancyclic digraph
0 references
\(k\)-traceable
0 references
traceability conjecture
0 references
path partition conjecture
0 references
0 references
0 references
0.92744124
0 references
0.9215136
0 references
0.9164897
0 references
0 references
0.9093901
0 references
0 references
0 references
0.9051696
0 references
