A note on the decomposition of graphs into isomorphic matchings
From MaRDI portal
Publication:790841
DOI10.1007/BF01956769zbMath0535.05047OpenAlexW1992605889MaRDI QIDQ790841
Publication date: 1983
Published in: Acta Mathematica Hungarica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01956769
Related Items (29)
Edge-disjoint packings of graphs ⋮ Decompositions of complete graphs into circulants ⋮ Scheduling with conflicts: Online and offline algorithms ⋮ Edge decomposition into isomorphic copies of \(sK_{1,2}\) is polynomial ⋮ Delta-system decompositions of graphs ⋮ Decomposition of large combinatorial structures ⋮ A Helly property of arcs ⋮ On graphs that have a unique least commonMultiple ⋮ Edge decompositions and rooted packings of graphs ⋮ The mutual exclusion scheduling problem for permutation and comparability graphs. ⋮ Towards a solution of the Holyer's problem ⋮ A survey on the existence ofG-Designs ⋮ Combinatorial and computational aspects of graph packing and graph decomposition ⋮ Bounded max-colorings of graphs ⋮ Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem ⋮ NP-completeness of graph decomposition problems ⋮ Mutual exclusion scheduling with interval graphs or related classes. II ⋮ On Rooted Packings, Decompositions, and Factors of Graphs ⋮ Scheduling jobs on identical machines with agreement graph ⋮ Multigraph decomposition into stars and into multistars ⋮ Polynomial cases of graph decomposition: A complete solution of Holyer's problem ⋮ Blocking sets for cycles and paths designs ⋮ On some multigraph decomposition problems and their computational complexity ⋮ Edge decompositions into two kinds of graphs ⋮ On colored designs. II ⋮ Clique and anticlique partitions of graphs ⋮ Clique partitioning with value-monotone submodular cost ⋮ Random packings of graphs ⋮ Equitable colorings of bounded treewidth graphs
Cites Work
This page was built for publication: A note on the decomposition of graphs into isomorphic matchings
