Decomposing semi-complete multigraphs and directed graphs into paths of length two
From MaRDI portal
Recommendations
Cites work
- \(\vec{P_3}\)-decomposition of directed graphs
- A Faster Deterministic Maximum Flow Algorithm
- Decomposition of multigraphs
- Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
- scientific article; zbMATH DE number 874528 (Why is no real title available?)
- Maximum matching and a polyhedron with 0,1-vertices
- Polynomial cases of graph decomposition: A complete solution of Holyer's problem
- Some Properties of Graphs with Multiple Edges
- The Factorization of Linear Graphs
Cited in
(6)- A \(\vec{P_3}\)-decomposition of tournaments and bipartite digraphs
- scientific article; zbMATH DE number 994585 (Why is no real title available?)
- scientific article; zbMATH DE number 398969 (Why is no real title available?)
- scientific article; zbMATH DE number 867679 (Why is no real title available?)
- scientific article; zbMATH DE number 1388903 (Why is no real title available?)
- scientific article; zbMATH DE number 5237268 (Why is no real title available?)
This page was built for publication: Decomposing semi-complete multigraphs and directed graphs into paths of length two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2971644)