Chromatically supremal decompositions of graphs

DOI10.1007/s00373-010-0876-2zbMath1219.05138OpenAlexW2057325505MaRDI QIDQ1959707

Robert E. Jamison, Eric Mendelsohn

Publication date: 7 October 2010

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-010-0876-2

zbMATH Keywords

designintersection graphcoloringgraph decompositiontactical configuration

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial aspects of block designs (05B05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Cites Work

• E ₁₁ and M theory
• Isomorphic Factorisations. I: Complete Graphs
• On the chromatic spectrum of acyclic decompositions of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item