scientific article; zbMATH DE number 3889553

MaRDI QIDQ3222866zbMATH OpenFDO

Authors C. Berge

Publication date 1984

zbMATH Keywords

acyclic digraphscoloringdirected graphGallai-Milgram theoremGreene-Kleitman theoremk-optimal partitionmaximum path lengthsymmetric graphsvertex disjoint paths

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On the Berge's strong path partition conjecture
• scientific article; zbMATH DE number 202590
• On Greene-Kleitman's theorem for general digraphs
• On greene's theorem for digraphs
• Proof of Berge's path partition conjecture for \(k \geq \lambda - 3\)

Cited in

(11)

• On k-optimum dipath partitions and partial k-colourings of acyclic digraphs
• Coflow polyhedra
• On the Berge's strong path partition conjecture
• Motivations and history of some of my conjectures
• Conditions for graphs to be path partition optimal
• An algorithmic note on the gallai-milgram theorem
• On path partitions and colourings in digraphs
• scientific article; zbMATH DE number 3900787 (Why is no real title available?)
• On greene's theorem for digraphs
• scientific article; zbMATH DE number 202590 (Why is no real title available?)
• On Greene-Kleitman's theorem for general digraphs

This page was built for publication:

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