Path Partitions, Cycle Covers and Integer Decomposition

DOI10.1007/978-3-642-02029-2_18zbMath1194.05126OpenAlexW2134291008MaRDI QIDQ3655152

András Sebő

Publication date: 7 January 2010

Published in: Graph Theory, Computational Intelligence and Thought (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02029-2_18

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

Proof of Berge's path partition conjecture for \(k \geq \lambda - 3\) ⋮ Box-total dual integrality, box-integrality, and equimodular matrices ⋮ Polyhedra with the integer Carathéodory property

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Greene-Kleitman's theorem for general digraphs
• Minmax relations for cyclically ordered digraphs
• Spannning a strong digraph by \(\alpha\) circuits: a proof of Gallai's conjecture
• Finding coherent cyclic orders in strong digraphs
• Cyclic orders: equivalence and duality
• Path partitions and packs of acyclic digraphs
• Intersection graphs of paths in a tree
• On k-optimum dipath partitions and partial k-colourings of acyclic digraphs
• A short proof of the existence of k-saturated partitions of partially ordered sets
• On the orientation of graphs
• Extending the Greene-Kleitman theorem to directed graphs
• k-optimal partitions of a directed graph
• Comparability graphs and intersection graphs
• Coflow polyhedra
• Orthogonal structures in directed graphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• A Berge-keeping operation for graphs
• Proof of Berge's strong path partition conjecture for \(k=2\)
• The \(k\)-edge intersection graphs of paths in a tree
• Wheels within wheels
• Diconnected Orientations and a Conjecture of Las Vergnas
• Nombre chromatique et plus longs chemins d'un graphe
• The structure of Sperner k-families

This page was built for publication: Path Partitions, Cycle Covers and Integer Decomposition