Le nombre maximal de 3-colorations d'un graphe connexe. (The maximal number of 3-colorations of a connected graph)

DOI10.1016/0012-365X(72)90042-8zbMath0226.05115MaRDI QIDQ2548964

Ioan Tomescu

Publication date: 1972

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

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (9)

Upper bounds on the chromatic polynomial of a connected graph with fixed clique number ⋮ A proof of Tomescu's graph coloring conjecture ⋮ Extremal colorings and independent sets ⋮ Le nombre maximal de colorations d'un graphe Hamiltonien ⋮ The maximum number of colorings of graphs of given order and size: a survey ⋮ Maximum number of colourings: 5-chromatic case ⋮ Maximum number of colourings: 4-chromatic graphs ⋮ New bounds for chromatic polynomials and chromatic roots ⋮ Extremal bicyclic 3-chromatic graphs

Cites Work

• An introduction to chromatic polynomials
• Uniquely colorable graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Le nombre maximal de 3-colorations d'un graphe connexe. (The maximal number of 3-colorations of a connected graph)