Path Partitions, Cycle Covers and Integer Decomposition
DOI10.1007/978-3-642-02029-2_18zbMATH Open1194.05126OpenAlexW2134291008MaRDI QIDQ3655152FDOQ3655152
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
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
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)
Cites Work
- Title not available (Why is that?)
- Intersection graphs of paths in a tree
- Comparability graphs and intersection graphs
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Title not available (Why is that?)
- The \(k\)-edge intersection graphs of paths in a tree
- A short proof of the existence of k-saturated partitions of partially ordered sets
- Extending the Greene-Kleitman theorem to directed graphs
- k-optimal partitions of a directed graph
- Proof of Berge's strong path partition conjecture for \(k=2\)
- Title not available (Why is that?)
- Nombre chromatique et plus longs chemins d'un graphe
- The structure of Sperner k-families
- Title not available (Why is that?)
- Title not available (Why is that?)
- Minmax relations for cyclically ordered digraphs
- Diconnected Orientations and a Conjecture of Las Vergnas
- On the orientation of graphs
- Path partitions and packs of acyclic digraphs
- Spannning a strong digraph by \(\alpha\) circuits: a proof of Gallai's conjecture
- Orthogonal structures in directed graphs
- On k-optimum dipath partitions and partial k-colourings of acyclic digraphs
- On Greene-Kleitman's theorem for general digraphs
- Coflow polyhedra
- Cyclic orders: equivalence and duality
- Wheels within wheels
- Finding coherent cyclic orders in strong digraphs
- A Berge-keeping operation for graphs
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)
