Decomposing Semi-complete Multigraphs and Directed Graphs into Paths of Length Two
From MaRDI portal
Publication:2971644
DOI10.1007/978-3-319-53007-9_15zbMath1487.05206MaRDI QIDQ2971644
Publication date: 7 April 2017
Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-53007-9_15
05C38: Paths and cycles
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C12: Distance in graphs
05C20: Directed graphs (digraphs), tournaments
Cites Work
- Unnamed Item
- Polynomial cases of graph decomposition: A complete solution of Holyer's problem
- \(\vec{P_3}\)-decomposition of directed graphs
- Decomposition of multigraphs
- A Faster Deterministic Maximum Flow Algorithm
- Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
- Some Properties of Graphs with Multiple Edges
- Maximum matching and a polyhedron with 0,1-vertices
- The Factorization of Linear Graphs