On Rooted Packings, Decompositions, and Factors of Graphs
From MaRDI portal
Publication:5418772
DOI10.1002/jgt.21753zbMath1291.05161OpenAlexW1499004411MaRDI QIDQ5418772
Zbigniew Lonc, Nataliya Petryshyn
Publication date: 28 May 2014
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.21753
Related Items (1)
Cites Work
- A note on the decomposition of graphs into isomorphic matchings
- Polynomial cases of graph decomposition: A complete solution of Holyer's problem
- NP-completeness of graph decomposition problems
- Edge decomposition into isomorphic copies of \(sK_{1,2}\) is polynomial
- On the Complexity of General Graph Factor Problems
- 3K2-decomposition of a graph
- The NP-Completeness of Some Edge-Partition Problems
- A Characterization in of Upper-Embeddable Graphs
- Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
- Perfect path double covers of graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On Rooted Packings, Decompositions, and Factors of Graphs