Induced decompositions of graphs

DOI10.1002/JGT.21654MaRDI QIDQ4916103zbMATH OpenOpenAlexFDO

Authors J. A. Bondy, Jayme L. 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

decompositionextremal graph theoryinduced subgraph

Mathematics Subject Classification ID

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

Recommendations

• Induced decompositions of highly dense graphs
• Transversal designs and induced decompositions of graphs
• scientific article; zbMATH DE number 1101882
• Decompositions of generalized complete graphs
• Extremal subgraphs for two graphs

Cites work

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

Cited in

(8)

• Optimal partial clique edge covering guided by potential energy minimization
• Transversal designs and induced decompositions of graphs
• Induced decompositions of highly dense graphs
• New Bounds of Induced Acyclic Graphoidal Decomposition Number of a Graph
• Equitable induced decompositions of twin graphs
• On maximal decompositions of graphs
• Extremal subgraphs for two graphs
• Friendship decompositions of graphs

This page was built for publication: Induced decompositions of graphs

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