On Rooted Packings, Decompositions, and Factors of Graphs

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

zbMATH Keywords

graph decompositiongraph packinggraph factor

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Edge decompositions and rooted packings of graphs

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