A new construction technique of a triangle-free 3-colored K16's

DOI10.1016/j.ins.2006.12.002zbMath1116.68061OpenAlexW2074837504MaRDI QIDQ881858

Jihad Mohamad Jaam

Publication date: 18 May 2007

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2006.12.002

zbMATH Keywords

graphsatisfiabilitymulticolor Ramsey number

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Cites Work

• Unnamed Item
• Unnamed Item
• A simple construction giving the two non-isomorphic triangle-free 3-colored \(K_{16}\)'s
• Ramsey-type theorems for metric spaces with applications to online problems
• Ramsey theory applications
• On the maximal triangle-free edge-chromatic graphs in three colors
• Combinatorial Relations and Chromatic Graphs
• Compression using efficient multicasting

This page was built for publication: A new construction technique of a triangle-free 3-colored K16's