A traceability conjecture for oriented graphs

zbMath1178.05046MaRDI QIDQ1010888

J. Martínez

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/117284

zbMATH Keywords

hamiltonian graphtraceabilitytraceable graphhamiltonicitypath partition conjecture for oriented graphsstrong oriented graphstraceable digraph

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (9)

Every 8-traceable oriented graph is traceable ⋮ Computational results on the traceability of oriented graphs of small order ⋮ Forbidden subdigraphs conditions on the traceability conjecture ⋮ A linear bound towards the traceability conjecture ⋮ Triangle-free oriented graphs and the traceability conjecture ⋮ Cycles in \(k\)-traceable oriented graphs ⋮ Traceability of \(k\)-traceable oriented graphs ⋮ The order of hypotraceable oriented graphs ⋮ Infinite families of 2-hypohamiltonian/2-hypotraceable oriented graphs

This page was built for publication: A traceability conjecture for oriented graphs