Maximum chromatic polynomial of 3-chromatic blocks

DOI10.1016/S0012-365X(96)00276-2zbMath0883.05052MaRDI QIDQ1366786

Ioan Tomescu

Publication date: 16 March 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

chromatic polynomials2-connected graphs3-colourings

Mathematics Subject Classification ID

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

Related Items (5)

Upper bounds on the chromatic polynomial of a connected graph with fixed clique number ⋮ A proof of Tomescu's graph coloring conjecture ⋮ The maximum number of colorings of graphs of given order and size: a survey ⋮ Maximum number of colourings: 4-chromatic graphs ⋮ New bounds for chromatic polynomials and chromatic roots

Cites Work

• Unnamed Item
• Maximum chromatic polynomials of 2‐connected graphs
• Minimally 2-connected graphs.
• On Minimal Blocks

This page was built for publication: Maximum chromatic polynomial of 3-chromatic blocks