Decomposing Semi-complete Multigraphs and Directed Graphs into Paths of Length Two (Q2971644): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-53007-9_15 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2585957176 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4876966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial cases of graph decomposition: A complete solution of Holyer's problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\vec{P_3}\)-decomposition of directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Properties of Graphs with Multiple Edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Deterministic Maximum Flow Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factorization of Linear Graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:22, 13 July 2024

scientific article
Language Label Description Also known as
English
Decomposing Semi-complete Multigraphs and Directed Graphs into Paths of Length Two
scientific article

    Statements