Spannning a strong digraph by \(\alpha\) circuits: a proof of Gallai's conjecture (Q949757): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Path Partitions in Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of the Chen-Manalastas theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diconnected Orientations and a Conjecture of Las Vergnas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267901 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every finite strongly connected digraph of stability 2 has a Hamiltonian path / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition theorem for partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5544082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3283482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular chromatic number: A survey / rank
 
Normal rank

Revision as of 17:46, 28 June 2024

scientific article
Language Label Description Also known as
English
Spannning a strong digraph by \(\alpha\) circuits: a proof of Gallai's conjecture
scientific article

    Statements

    Identifiers