Decomposing large graphs with small graphs of high density

DOI10.1002/(SICI)1097-0118(199909)32:1%3C27::AID-JGT3%3E3.0.CO;2-CMaRDI QIDQ4265585zbMATH OpenOpenAlexFDO

Authors Raphael Yuster

Publication date 23 February 2000

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199909)32:1%3C27::aid-jgt3%3E3.0.co;2-c

zbMATH Keywords

decompositiondensity

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Decomposition of complete graphs into small graphs
• A decomposition of a graph into dense subgraphs
• Induced decompositions of highly dense graphs
• scientific article; zbMATH DE number 432834
• Computing the degeneracy of large graphs
• Low diameter graph decompositions
• Dense arbitrarily vertex decomposable graphs
• scientific article; zbMATH DE number 944226
• scientific article; zbMATH DE number 969094
• Large-treewidth graph decompositions and applications

Cited in

(8)

• Short paths in \(\varepsilon \)-regular pairs and small diameter decompositions of dense graphs
• Low diameter graph decompositions
• Induced decompositions of highly dense graphs
• Rational decomposition of dense hypergraphs and some related eigenvalue estimates
• Decompositions into subgraphs of small diameter
• Extremal aspects of graph and hypergraph decomposition problems
• Decomposing graphs of high minimum degree into 4-cycles
• Edge-decompositions of graphs with high minimum degree

This page was built for publication: Decomposing large graphs with small graphs of high density

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4265585)