Characterizations of k-traceable graphs and oriented graphs

MaRDI QIDQ2848806zbMATH OpenFDO

Authors Susan Van Aardt, Marietjie Frick, Jean E. Dunbar, Morten H. Nielsen, Ortrud R. Oellermann

Publication date 26 September 2013

Published in Utilitas Mathematica (Search for Journal in Brave)

zbMATH Keywords

\(k\)-traceablehypotraceable graphoriented graphtournament

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Structural characterization of families of graphs (05C75)

Recommendations

• Traceability of k-traceable oriented graphs
• Every 8-traceable oriented graph is traceable
• A linear bound towards the traceability conjecture
• Progress on the traceability conjecture for oriented graphs
• Cycles in \(k\)-traceable oriented graphs

Cited in

(9)

• A traceability conjecture for oriented graphs
• An iterative approach to the traceability conjecture for oriented graphs
• Every 8-traceable oriented graph is traceable
• scientific article; zbMATH DE number 3972886 (Why is no real title available?)
• scientific article; zbMATH DE number 3972890 (Why is no real title available?)
• scientific article; zbMATH DE number 4099351 (Why is no real title available?)
• Hamiltonicity of k-traceable graphs
• Cycles in \(k\)-traceable oriented graphs
• Traceability of k-traceable oriented graphs

This page was built for publication: Characterizations of \(k\)-traceable graphs and oriented graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848806)