Some new bounds for the maximum number of vertex colorings of a (v,e)-graph

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199807)28:3<115::AID-JGT1>3.0.CO;2-N" /><115::AID-JGT1>3.0.CO;2-N 10.1002/(SICI)1097-0118(199807)28:3<115::AID-JGT1>3.0.CO;2-NzbMath0930.05038OpenAlexW4255608732MaRDI QIDQ4242963

Owen D. Byer

Publication date: 30 January 2000

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199807)28:3<115::aid-jgt1>3.0.co;2-n

zbMATH Keywords

chromatic polynomialvertex coloringspseudo-proper colorings

Mathematics Subject Classification ID

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

Related Items (2)

Maximizing proper colorings on graphs ⋮ The maximum number of colorings of graphs of given order and size: a survey

This page was built for publication: Some new bounds for the maximum number of vertex colorings of a (v,e)-graph