A Construction of Uniquely C4-free colourable Graphs

DOI10.1080/16073606.1990.9631616zbMath0725.05042OpenAlexW2002646915MaRDI QIDQ5203050

Izak Broere, Gerhard Benadé, Jason I. Brown

Publication date: 1990

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/16073606.1990.9631616

zbMATH Keywords

C\({}_ 4\)-free colourable graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (4)

The existence of uniquely \(-G\) colourable graphs ⋮ The complexity of generalized graph colorings ⋮ ON UNIQUELY -G k-COLOURABLE GRAPHS ⋮ Unnamed Item

Cites Work

• On generalized graph colorings

This page was built for publication: A Construction of Uniquely C₄-free colourable Graphs