A note on the decomposition of graphs into isomorphic matchings
From MaRDI portal
(Redirected from Publication:790841)
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; zbMATH DE number 3675942
- Positive matching decompositions of graphs
- scientific article; zbMATH DE number 398946
Cites work
Cited in
(33)- The complexity of decomposing a graph into a matching and a bounded linear forest
- Edge decompositions and rooted packings of graphs
- Clique and anticlique partitions of graphs
- Combinatorial and computational aspects of graph packing and graph decomposition
- Equitable colorings of bounded treewidth graphs
- A Helly property of arcs
- 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
- Decompositions of complete graphs into circulants
- Blocking sets for cycles and paths designs
- Random packings of graphs
- Multigraph decomposition into stars and into multistars
- On some multigraph decomposition problems and their computational complexity
- On rooted packings, decompositions, and factors of graphs
- Decomposition of a \(3K_{8t}\) into \(H_2\) graphs.
- The mutual exclusion scheduling problem for permutation and comparability graphs.
- Bounded max-colorings of graphs
- Edge-disjoint packings of graphs
- Scheduling with conflicts: Online and offline algorithms
- Decomposition of large combinatorial structures
- Mutual exclusion scheduling with interval graphs or related classes. II
- Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
- Edge decomposition into isomorphic copies of \(sK_{1,2}\) is polynomial
- scientific article; zbMATH DE number 398946 (Why is no real title available?)
- Edge decompositions into two kinds of graphs
- Delta-system decompositions of graphs
- Scheduling jobs on identical machines with agreement graph
- On graphs that have a unique least common multiple
- NP-completeness of graph decomposition problems
- Polynomial cases of graph decomposition: A complete solution of Holyer's problem
- A survey on the existence ofG-Designs
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)
