Minimal decompositions of graphs into mutually isomorphic subgraphs

DOI10.1007/BF02579173zbMath0491.05049OpenAlexW2150278998MaRDI QIDQ1167190

Paul Erdős, Ronald L. Graham, Fan R. K. Chung

Publication date: 1981

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579173

zbMATH Keywords

factorizationpartition of edge set

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Universal and unavoidable graphs, Mathematical problems and games, Edit distance measure for graphs, On unavoidable graphs, Decomposing Random Permutations into Order-Isomorphic Subpermutations, Unnamed Item, Minimal decompositions of hypergraphs into mutually isomorphic subhypergraphs, Twin subgraphs and core-semiperiphery-periphery structures, Variations on twins in permutations, Extremal subgraphs for two graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Graph 2-isomorphism is NP-complete