Induced Decompositions of Graphs

DOI10.1002/jgt.21654zbMath1261.05082OpenAlexW2098322636MaRDI QIDQ4916103

J. A. Bondy, Jayme Luiz Szwarcfiter

Publication date: 19 April 2013

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.21654

zbMATH Keywords

decompositioninduced subgraphextremal graph theory

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 (3)

Induced Decompositions of Highly Dense Graphs ⋮ Unnamed Item ⋮ Optimal partial clique edge covering guided by potential energy minimization

Cites Work

• Polynomial cases of graph decomposition: A complete solution of Holyer's problem
• Optimal packings of \(K_4\)'s into a \(K_n\)
• Maximal consistent families of triples

This page was built for publication: Induced Decompositions of Graphs