Some corollaries of a theorem of Whitney on the chromatic polynomial

DOI10.1016/0012-365X(91)90070-IzbMath0721.05021MaRDI QIDQ2640610

Felix Lazebnik

Publication date: 1991

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

zbMATH Keywords

chromatic polynomialextremal graphproper lambda-colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (7)

A bibliography on chromatic polynomials ⋮ The Extremality of 2-Partite Turán Graphs with Respect to the Number of Colorings ⋮ Maximizing proper colorings on graphs ⋮ Optimal graphs for chromatic polynomials ⋮ The maximum number of colorings of graphs of given order and size: a survey ⋮ Maximum number of colourings: 4-chromatic graphs ⋮ Counting colorings of a regular graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Backtrack: An O(1) expected time algorithm for the graph coloring problem
• Parallel concepts in graph theory
• Coefficients of chromatic polynomials
• The Chromatic Polynomial of a Complete Bipartite Graph
• A theoretical analysis of backtracking in the graph coloring problem
• On the greatest number of 2 and 3 colorings of a (v, e)-graph
• New upper bounds for the greatest number of proper colorings of a (V,E)‐graph
• Counting Coloured Graphs. III
• Triangles in an Ordinary Graph
• On the Number of Triangles Contained in Certain Graphs

This page was built for publication: Some corollaries of a theorem of Whitney on the chromatic polynomial