Coloured Graphs: A Correction and Extension

DOI10.4153/CJM-1970-066-1MaRDI QIDQ5598928zbMATH OpenOpenAlexFDO

Authors Ronald C. Read, Edward Maitland Wright

Publication date 1970

Published in Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/cjm-1970-066-1

zbMATH Keywords

asymptotic resultscoloured graphsnumber of connected labelled graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited in

(5)

• Representation of graphs by OBDDs
• Recoloring the colored de Bruijn graph
• Lifted inference beyond first-order logic
• Backtrack: An O(1) expected time algorithm for the graph coloring problem
• Matrix integrals and map enumeration: an accessible introduction

This page was built for publication: Coloured Graphs: A Correction and Extension

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