THE UNIQUE EQUIVALENCE CLASS OF CHROMATIC RECTANGLE FREE 3-COLORINGS OF A 10 × 10 CHESSBOARD

DOI10.1142/S1793557110000544zbMATH Open1204.05054MaRDI QIDQ3067256FDOQ3067256

Authors: L. K. Waters 

Publication date: 20 January 2011

Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)

Recommendations

• The chromatic uniqueness of \(W_{10}\)
• A note on the chromatic uniqueness of \(W_ 10\)
• Restricted coloring of \(1\)-by-\(n\) chessboards
• On 3-chromatically unique and 3-chromatically equivalent hypergraphs
• Total chromatic number of \{square,unichord\}-free graphs
• The chromatically equivalence theorem of three kinds of combinatorial graphs
• A note on uniquely 10‐colorable graphs
• scientific article; zbMATH DE number 1248114
• The chromatic equivalence class of \(K_{1, n, n + 2}\)
• Uniquely \(n\)-colorable and chromatically equivalent graphs

zbMATH Keywords

algorithmscombinatoricscoloringprogrammingmaximal packingschromatic rectangles

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Recreational mathematics (00A08)

Cites Work

• Packing a Square Lattice with a Rectangle-Free Set of Points
• A Chessboard Coloring Problem

Cited In (1)

• Restricted coloring of \(1\)-by-\(n\) chessboards

This page was built for publication: THE UNIQUE EQUIVALENCE CLASS OF CHROMATIC RECTANGLE FREE 3-COLORINGS OF A 10 × 10 CHESSBOARD

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