New upper bounds for the greatest number of proper colorings of a (V,E)‐graph

DOI10.1002/jgt.3190140104zbMath0688.05042OpenAlexW2069550285WikidataQ126254306 ScholiaQ126254306MaRDI QIDQ4206761

Felix Lazebnik

Publication date: 1990

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

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

zbMATH Keywords

chromatic polynomialgreatest number of proper colorings

Mathematics Subject Classification ID

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

Related Items (7)

A contribution to the chromatic theory of uniform hypergraphs ⋮ Some corollaries of a theorem of Whitney on the chromatic polynomial ⋮ A bibliography on chromatic polynomials ⋮ Maximizing proper colorings on graphs ⋮ On deterministic finite automata and syntactic monoid size ⋮ The maximum number of colorings of graphs of given order and size: a survey ⋮ Maximum number of colourings: 4-chromatic graphs

Cites Work

• Unnamed Item
• Counting Coloured Graphs. III

This page was built for publication: New upper bounds for the greatest number of proper colorings of a (V,E)‐graph