On the Decomposition of Graphs

DOI10.1137/0602001MaRDI QIDQ3964612zbMATH OpenOpenAlexFDO

Authors Fan Chung

Publication date 1981

Published in SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/9570f502676bfc39b5e30c8dcb6df97dc6add2eb

zbMATH Keywords

complete bipartite graphcomplete graphsdecompositions into edge-disjoint subgraphs

Mathematics Subject Classification ID

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

Cites work

• Decomposition of Finite Graphs Into Forests
• scientific article; zbMATH DE number 3841905 (Why is no real title available?)
• scientific article; zbMATH DE number 3207626 (Why is no real title available?)
• scientific article; zbMATH DE number 3232670 (Why is no real title available?)
• scientific article; zbMATH DE number 3238444 (Why is no real title available?)
• scientific article; zbMATH DE number 3253072 (Why is no real title available?)
• scientific article; zbMATH DE number 3261634 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• scientific article; zbMATH DE number 3313256 (Why is no real title available?)
• On partitions of graphs into trees
• On the Addressing Problem for Loop Switching
• On the coverings of graphs
• Proof of a conjecture of Katona and Tarjan
• The Representation of a Graph by Set Intersections

Cited in

(24)

• Extensions of networks with given diameter
• Proof of a conjecture of Katona and Tarjan
• Examples of products giving large graphs with given degree and diameter
• Restricted greedy clique decompositions and greedy clique decompositions of \(K_ 4\)-free graphs
• Greedy maximum-clique decompositions
• Edge clique covering sum of graphs
• New bounds for the CLIQUE-GAP problem using graph decomposition theory
• Greedy clique decompositions and the Turán numbers
• Eigenvalues and clique partitions of graphs
• Clique coverings and claw-free graphs
• On clique coverings of complete multipartite graphs
• A bound on the total size of a cut cover
• Pairwise balanced designs and sigma clique partitions
• New bounds for the CLIQUE-GAP problem using graph decomposition theory
• Sharp bounds for decomposing graphs into edges and triangles
• Decomposing graphs into edges and triangles
• Algorithmic complexity of weakly semiregular partitioning and the representation number
• On the number of edge-disjoint triangles in \(K_4\)-free graphs
• On the number of edge-disjoint triangles in \(K_4\)-free graphs
• Sharp bounds for decomposing graphs into edges and triangles
• Two trees are better than one
• Consensus algorithms for the generation of all maximal bicliques
• Spectral radius and clique partitions of graphs
• Clique partitions of distance multigraphs

This page was built for publication: On the Decomposition of Graphs

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