scientific article; zbMATH DE number 3353319

zbMath0223.05115MaRDI QIDQ5628155

Ioan Tomescu

Publication date: 1971

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (10)

Upper bounds on the chromatic polynomial of a connected graph with fixed clique number ⋮ A proof of Tomescu's graph coloring conjecture ⋮ Brève communication. Une caractérisation des graphes $k-$chromatiques minimaux sans sommet isolé ⋮ Maximizing the number of \(x\)-colorings of 4-chromatic graphs ⋮ Extremal colorings and independent sets ⋮ Le nombre maximal de colorations d'un graphe Hamiltonien ⋮ Maximum number of colourings: 5-chromatic case ⋮ Maximum number of colourings: 4-chromatic graphs ⋮ Tomescu's Graph Coloring Conjecture for $\ell$-Connected Graphs ⋮ New bounds for chromatic polynomials and chromatic roots

This page was built for publication: