Graphs with unique Ramsey colorings

DOI10.1002/jgt.3190070111zbMath0512.05043OpenAlexW2094721217MaRDI QIDQ4750675

Jerrold W. Grossman

Publication date: 1983

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

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

zbMATH Keywords

unique factorizationcleavernoncomplete Ramsey theorypair of graphsunique colorings

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items (4)

The complexity of \(G\)-free colourability ⋮ The existence of uniquely \(-G\) colourable graphs ⋮ ON UNIQUELY -G k-COLOURABLE GRAPHS ⋮ On the use of senders in generalized Ramsey theory for graphs

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: Graphs with unique Ramsey colorings