Covering digraphs by paths

DOI10.1016/0012-365X(78)90007-9MaRDI QIDQ1250116zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• scientific article; zbMATH DE number 3165195 (Why is no real title available?)
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• A decomposition theorem for partially ordered sets
• An upper bound on the path number of a digraph
• On Representatives of Subsets
• Path decompositions of digraphs
• Path numbers of tournaments
• Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente

Cited in

(16)

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

This page was built for publication: Covering digraphs by paths

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