On the Decomposition of Graphs

DOI10.1137/0602001zbMath0499.05046OpenAlexW2121281842MaRDI QIDQ3964612

Fan R. K. 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)

Related Items

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

Cites Work

• Proof of a conjecture of Katona and Tarjan
• On the coverings of graphs
• On partitions of graphs into trees
• The Representation of a Graph by Set Intersections
• On the Addressing Problem for Loop Switching
• Decomposition of Finite Graphs Into Forests
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item