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

DOI10.1002/(SICI)1097-0118(199807)28:3%3C115::AID-JGT1%3E3.0.CO;2-NMaRDI QIDQ4242963zbMATH OpenOpenAlexFDO

Authors Owen D. Byer

Publication date 30 January 2000

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199807)28:3%3C115::aid-jgt1%3E3.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)

Recommendations

• New upper bounds for the greatest number of proper colorings of a (V,E)‐graph
• scientific article; zbMATH DE number 1262192
• A new upper bound for total colourings of graphs
• On the greatest number of 2 and 3 colorings of a (v, e)-graph
• Bounded max-colorings of graphs
• Bounded Max-colorings of Graphs
• Some maximum multigraphs and adge/vertex distance colourings
• scientific article; zbMATH DE number 15467
• Bounded vertex colorings of graphs
• scientific article; zbMATH DE number 5079785

Cited in

(5)

• The maximum number of colorings of graphs of given order and size: a survey
• Counting the number of non-equivalent vertex colorings of a graph
• Maximizing proper colorings on graphs
• New upper bounds for the greatest number of proper colorings of a (V,E)‐graph
• A sharp lower bound on the number of non-equivalent colorings of graphs of order \(n\) and maximum degree \(n - 3\)

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

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