Decomposing Semi-complete Multigraphs and Directed Graphs into Paths of Length Two

DOI10.1007/978-3-319-53007-9_15zbMath1487.05206OpenAlexW2585957176MaRDI QIDQ2971644

Sai Sandeep, Ajit A. Diwan

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

zbMATH Keywords

path decompositionsemi-complete multigraph

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)

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

This page was built for publication: Decomposing Semi-complete Multigraphs and Directed Graphs into Paths of Length Two