A Construction of Uniquely C4-free colourable Graphs

DOI10.1080/16073606.1990.9631616zbMATH Open0725.05042OpenAlexW2002646915MaRDI QIDQ5203050FDOQ5203050

Authors: Gerhard Benadé, Izak Broere, 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

Recommendations

• A construction of uniquely colourable graphs with equal colour class sizes
• scientific article; zbMATH DE number 3912409
• The existence of uniquely \(-G\) colourable graphs
• ON UNIQUELY -G k-COLOURABLE GRAPHS
• A coloring algorithm for \(4 K_1\)-free line graphs

zbMATH Keywords

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

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• On generalized graph colorings

Cited In (5)

• The existence of uniquely \(-G\) colourable graphs
• ON UNIQUELY -G k-COLOURABLE GRAPHS
• The complexity of generalized graph colorings
• Title not available (Why is that?)
• Which graphs can be counted in \(C_4\)-free graphs?

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

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