Spannning a strong digraph by circuits: a proof of Gallai's conjecture
DOI10.1007/S00493-007-2073-3zbMATH Open1236.05091OpenAlexW1981468140WikidataQ123151409 ScholiaQ123151409MaRDI QIDQ949757FDOQ949757
Authors: Stéphane Bessy, Stéphan Thomassé 
Publication date: 21 October 2008
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-007-2073-3
Recommendations
- Integer Programming and Combinatorial Optimization
- Every strong digraph has a spanning strong subgraph with at most \(n+2\alpha-2\) arcs
- Covering a strong digraph by \(\alpha-1\) disjoint paths: A proof of Las Vergnas' conjecture
- The Gallai-Younger conjecture for planar graphs
- Paths and stability number in digraphs
Directed graphs (digraphs), tournaments (05C20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Paths and cycles (05C38)
Cites Work
- Title not available (Why is that?)
- A decomposition theorem for partially ordered sets
- Title not available (Why is that?)
- Circular chromatic number: A survey
- Title not available (Why is that?)
- Diconnected Orientations and a Conjecture of Las Vergnas
- Title not available (Why is that?)
- Every finite strongly connected digraph of stability 2 has a Hamiltonian path
- Path Partitions in Directed Graphs
- A short proof of the Chen-Manalastas theorem
Cited In (13)
- Path Partitions, Cycle Covers and Integer Decomposition
- A short proof of the Chen-Manalastas theorem
- BE-diperfect digraphs with stability number two
- A network flow approach to a common generalization of Clar and Fries numbers
- Berge's conjecture on directed path partitions -- a survey
- Every strong digraph has a spanning strong subgraph with at most \(n+2\alpha-2\) arcs
- Structural properties of minimal strong digraphs versus trees
- Cyclic orders: equivalence and duality
- Integer Programming and Combinatorial Optimization
- Covering a strong digraph by \(\alpha-1\) disjoint paths: A proof of Las Vergnas' conjecture
- Shortcutting directed and undirected networks with a degree constraint
- Structural and spectral properties of minimal strong digraphs
- Variations on the Gallai-Milgram theorem
This page was built for publication: Spannning a strong digraph by \(\alpha\) circuits: a proof of Gallai's conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q949757)
