Variations on the Gallai-Milgram theorem

DOI10.1016/0012-365X(88)90063-5zbMath0661.05028MaRDI QIDQ1112833

Irith Ben-Arroyo Hartman

Publication date: 1988

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

independence numberchromatic numberpath partition

Mathematics Subject Classification ID

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

Related Items (5)

A short proof of the Chen-Manalastas theorem ⋮ Berge's conjecture on directed path partitions -- a survey ⋮ Shortcutting directed and undirected networks with a degree constraint ⋮ On vertex-disjoint paths in regular graphs ⋮ Minimum path cover in quasi-claw-free graphs

Cites Work

• A Chvátal-Erdős condition for (1,1)-factors in digraphs
• Every finite strongly connected digraph of stability 2 has a Hamiltonian path
• A note on Hamiltonian circuits
• Diconnected Orientations and a Conjecture of Las Vergnas
• Nombre chromatique et plus longs chemins d'un graphe
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Variations on the Gallai-Milgram theorem