Counting Coloured Graphs. III
From MaRDI portal
Publication:5618395
DOI10.4153/CJM-1972-010-7zbMath0215.33801OpenAlexW4246500452MaRDI QIDQ5618395
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
Related Items
The asymptotic number of acyclic digraphs. I ⋮ 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 ⋮ The maximum number of colorings of graphs of given order and size: a survey ⋮ New upper bounds for the greatest number of proper colorings of a (V,E)‐graph ⋮ Analytic description of the phase transition of inhomogeneous multigraphs
