Counting Coloured Graphs. III

DOI10.4153/CJM-1972-010-7MaRDI QIDQ5618395zbMATH OpenOpenAlexFDO

Authors Edward Maitland Wright

Publication date 1972

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

Full work available at URL https://doi.org/10.4153/cjm-1972-010-7

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited in

(6)

• The asymptotic number of acyclic digraphs. I
• The maximum number of colorings of graphs of given order and size: a survey
• Analytic description of the phase transition of inhomogeneous multigraphs
• Some corollaries of a theorem of Whitney on the chromatic polynomial
• On the greatest number of 2 and 3 colorings of a (v, e)-graph
• New upper bounds for the greatest number of proper colorings of a (V,E)‐graph

This page was built for publication: Counting Coloured Graphs. III

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