A note on the decomposition of graphs into isomorphic matchings
From MaRDI portal
Publication:790841
DOI10.1007/BF01956769zbMATH Open0535.05047OpenAlexW1992605889MaRDI QIDQ790841FDOQ790841
Publication date: 1983
Published in: Acta Mathematica Hungarica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01956769
Recommendations
- scientific article; zbMATH DE number 975403
- Decomposition of complete graphs into isomorphic complete bipartite graphs
- Decomposition of multigraphs into isomorphic graphs with two edges
- Decompositions of complete graphs into isomorphic bipartite subgraphs
- scientific article; zbMATH DE number 911779
- Minimal decompositions of graphs into mutually isomorphic subgraphs
- Self-orthogonal decompositions of graphs into matchings
- scientific article
- Positive matching decompositions of graphs
- scientific article; zbMATH DE number 398946
Cites Work
Cited In (31)
- Clique and anticlique partitions of graphs
- Edge decompositions and rooted packings of graphs
- Equitable colorings of bounded treewidth graphs
- Combinatorial and computational aspects of graph packing and graph decomposition
- A Helly property of arcs
- On Rooted Packings, Decompositions, and Factors of Graphs
- On colored designs. II
- Clique partitioning with value-monotone submodular cost
- Clique and anticlique partitions of graphs
- Towards a solution of the Holyer's problem
- Blocking sets for cycles and paths designs
- Decompositions of complete graphs into circulants
- Random packings of graphs
- Multigraph decomposition into stars and into multistars
- On some multigraph decomposition problems and their computational complexity
- On graphs that have a unique least commonMultiple
- The mutual exclusion scheduling problem for permutation and comparability graphs.
- Bounded max-colorings of graphs
- Mutual exclusion scheduling with interval graphs or related classes. II
- Edge-disjoint packings of graphs
- Decomposition of large combinatorial structures
- Scheduling with conflicts: Online and offline algorithms
- Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
- Title not available (Why is that?)
- Edge decomposition into isomorphic copies of \(sK_{1,2}\) is polynomial
- Edge decompositions into two kinds of graphs
- Delta-system decompositions of graphs
- Scheduling jobs on identical machines with agreement graph
- A survey on the existence ofG-Designs
- Polynomial cases of graph decomposition: A complete solution of Holyer's problem
- NP-completeness of graph decomposition problems
This page was built for publication: A note on the decomposition of graphs into isomorphic matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q790841)
