A traceability conjecture for oriented graphs
From MaRDI portal
Publication:1010888
zbMath1178.05046MaRDI QIDQ1010888
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
hamiltonian graph; traceability; traceable graph; hamiltonicity; path partition conjecture for oriented graphs; strong oriented graphs; traceable digraph
05C38: Paths and cycles
05C15: Coloring of graphs and hypergraphs
05C20: Directed graphs (digraphs), tournaments
05C45: Eulerian and Hamiltonian graphs