Packing cycles in graphs. II (Q1405116): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Min-Max Theorem on Feedback Vertex Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximation Algorithm for Feedback Vertex Sets in Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing directed circuits exactly / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two minimax theorems in graph / 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 circuits in eulerian digraphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:20, 6 June 2024

scientific article
Language Label Description Also known as
English
Packing cycles in graphs. II
scientific article

    Statements