Pages that link to "Item:Q949757"
From MaRDI portal
The following pages link to Spannning a strong digraph by \(\alpha\) circuits: a proof of Gallai's conjecture (Q949757):
Displaying 14 items.
- Shortcutting directed and undirected networks with a degree constraint (Q507583) (← links)
- Structural and spectral properties of minimal strong digraphs (Q510549) (← links)
- Cyclic orders: equivalence and duality (Q949788) (← links)
- Variations on the Gallai-Milgram theorem (Q1112833) (← links)
- The Gallai-Younger conjecture for planar graphs (Q1375627) (← links)
- Every strong digraph has a spanning strong subgraph with at most \(n+2\alpha-2\) arcs (Q1405121) (← links)
- Structural properties of minimal strong digraphs versus trees (Q1688914) (← links)
- Covering a strong digraph by \(\alpha-1\) disjoint paths: A proof of Las Vergnas' conjecture (Q1850573) (← links)
- A short proof of the Chen-Manalastas theorem (Q1903737) (← links)
- Berge's conjecture on directed path partitions -- a survey (Q2433711) (← links)
- Path Partitions, Cycle Covers and Integer Decomposition (Q3655152) (← links)
- Integer Programming and Combinatorial Optimization (Q5712448) (← links)
- BE-diperfect digraphs with stability number two (Q6574382) (← links)
- A network flow approach to a common generalization of Clar and Fries numbers (Q6589122) (← links)