Packing directed circuits exactly (Q663091): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Pólya's permanent problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Packing cycles in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Minimax Theorem for Directed Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Packing directed circuits / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Permanents, Pfaffian orientations, and even directed circuits / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Characterization of even directed graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Min-Max Theorem on Feedback Vertex Sets / rank | |||
Normal rank |
Latest revision as of 22:41, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Packing directed circuits exactly |
scientific article |
Statements
Packing directed circuits exactly (English)
0 references
13 February 2012
0 references
maximum packing of circuits
0 references
minimum transversals
0 references
minors
0 references
strongly planar digraphs
0 references
strongly connected digraphs
0 references