On the greatest number of 2 and 3 colorings of a (v, e)-graph

DOI10.1002/jgt.3190130207zbMath0677.05032OpenAlexW2034027701MaRDI QIDQ3832593

Felix Lazebnik

Publication date: 1989

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190130207

zbMATH Keywords

chromatic polynomialproper lambda colouring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (10)

Counting dominating sets and related structures in graphs ⋮ Some corollaries of a theorem of Whitney on the chromatic polynomial ⋮ A bibliography on chromatic polynomials ⋮ The Extremality of 2-Partite Turán Graphs with Respect to the Number of Colorings ⋮ A proof of Tomescu's graph coloring conjecture ⋮ Maximizing proper colorings on graphs ⋮ Optimal graphs for chromatic polynomials ⋮ Extremal graphs for homomorphisms ⋮ The maximum number of colorings of graphs of given order and size: a survey ⋮ Extremal H‐Colorings of Graphs with Fixed Minimum Degree

Cites Work

• Counting Coloured Graphs. III

This page was built for publication: On the greatest number of 2 and 3 colorings of a (v, e)-graph