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-8zbMATH Open0226.05115MaRDI QIDQ2548964FDOQ2548964

Authors: Ioan Tomescu 

Publication date: 1972

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

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• An introduction to chromatic polynomials
• Title not available (Why is that?)
• Title not available (Why is that?)
• Uniquely colorable graphs
• Title not available (Why is that?)

Cited In (10)

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

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)

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