Le nombre maximal de colorations d'un graphe Hamiltonien

DOI10.1016/S0012-365X(76)80010-6zbMath0344.05119MaRDI QIDQ1232417

Ioan Tomescu

Publication date: 1977

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Relations of low-dimensional topology with graph theory (57M15) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

The maximum number of colorings of graphs of given order and size: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Le nombre maximal de 3-colorations d'un graphe connexe. (The maximal number of 3-colorations of a connected graph)
• A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger
• An introduction to chromatic polynomials

This page was built for publication: Le nombre maximal de colorations d'un graphe Hamiltonien