Edge decompositions and rooted packings of graphs

DOI10.1016/j.disc.2022.113057zbMath1504.05235OpenAlexW4283702062MaRDI QIDQ2675822

Nataliya Petryshyn, Zbigniew Lonc

Publication date: 26 September 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2022.113057

zbMATH Keywords

edge decomposition of a graphrooted packing of a graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Cites Work

• Combinatorial and computational aspects of graph packing and graph decomposition
• Factors and factorizations of graphs. Proof techniques in factor theory
• A note on the decomposition of graphs into isomorphic matchings
• Polynomial cases of graph decomposition: A complete solution of Holyer's problem
• Edge decompositions into two kinds of graphs
• Packings by cliques and by finite families of graphs
• Packing subgraphs in a graph
• NP-completeness of graph decomposition problems
• Efficient subgraphs packing
• Edge decomposition into isomorphic copies of \(sK_{1,2}\) is polynomial
• Delta-system decompositions of graphs
• On the complexity of some edge-partition problems for graphs
• On the Complexity of General Graph Factor Problems
• Packings by Complete Bipartite Graphs
• 3K2-decomposition of a graph
• The NP-Completeness of Some Edge-Partition Problems
• Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
• On Rooted Packings, Decompositions, and Factors of Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Edge decompositions and rooted packings of graphs