Packing cycles in graphs (Q1403928): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2001669390 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Characterizations of derived graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4149476 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Independent Circuits Contained in a Graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Geometric algorithms and combinatorial optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4060999 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On two minimax theorems in graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3880849 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3330973 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3818127 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The matroids with the max-flow min-cut property / rank | |||
Normal rank |
Latest revision as of 10:05, 6 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Packing cycles in graphs |
scientific article |
Statements
Packing cycles in graphs (English)
0 references
20 August 2003
0 references
cycle Mengerian
0 references
forbidden structures
0 references