Covering digraphs by paths

DOI10.1016/0012-365X(78)90007-9zbMath0388.05038OpenAlexW1997073280MaRDI QIDQ1250116

Nathan Linial

Publication date: 1978

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

Full work available at URL: https://doi.org/10.1016/0012-365x(78)90007-9

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Graph theory (05C99) Directed graphs (digraphs), tournaments (05C20) Combinatorial aspects of packing and covering (05B40)

Related Items

On greene's theorem for digraphs ⋮ Minimum path decompositions of oriented cubic graphs ⋮ About colorings, stability and paths in directed graphs ⋮ Berge's conjecture on directed path partitions -- a survey ⋮ Extending the Greene-Kleitman theorem to directed graphs ⋮ k-optimal partitions of a directed graph ⋮ On the strong and the semi-strong path partition conjecture ⋮ On Linial's conjecture for spine digraphs ⋮ On the strong path partition conjecture of Berge ⋮ Berge's conjecture and Aharoni-Hartman-Hoffman's conjecture for locally in-semicomplete digraphs ⋮ An algorithmic note on the gallai-milgram theorem ⋮ On the Berge's strong path partition conjecture ⋮ Design of test inputs and their sequences in multi-function system testing ⋮ Diperfect graphs ⋮ Acyclic digraphs with Gallai-Milgram-Linial property for clique-covers

Cites Work

• Unnamed Item
• Unnamed Item
• Path numbers of tournaments
• An upper bound on the path number of a digraph
• Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente
• A decomposition theorem for partially ordered sets
• On Representatives of Subsets
• Path decompositions of digraphs

This page was built for publication: Covering digraphs by paths