Path Partitions, Cycle Covers and Integer Decomposition

DOI10.1007/978-3-642-02029-2_18MaRDI QIDQ3655152zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• A survey of the path partition conjecture
• Path partitions and \(P_{n}\)-free sets
• Path decompositions and Gallai's conjecture
• On the path partition of graphs
• On path partitions of the divisor graph
• On path partitions of the divisor graph
• A new approach to the path partition conjecture
• scientific article; zbMATH DE number 1334640
• scientific article; zbMATH DE number 3943845
• Path partitions and packs of acyclic digraphs

Cites work

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

Cited in

(5)

• Proof of Berge's path partition conjecture for \(k \geq \lambda - 3\)
• A decomposition property of polyhedra
• Box-total dual integrality, box-integrality, and equimodular matrices
• Polyhedra with the integer Carathéodory property
• Integer Decomposition for Polyhedra Defined by Nearly Totally Unimodular Matrices

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

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