scientific article

zbMATH Open1256.05113MaRDI QIDQ2914003

Ioan Tomescu

Publication date: 21 September 2012

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

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

zbMATH Keywords

chromatic polynomial3-color partitiongreatest valuesskeleton of a graph

Mathematics Subject Classification ID

Graph polynomials (05C31) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• On chromatic polynomials of some kinds of graphs 👍 👎
• Chromatic polynomials of connected graphs 👍 👎
• Structures and chromaticity of some extremal 3-colourable graphs 👍 👎
• Extremal bicyclic 3-chromatic graphs 👍 👎
• The 3-connectivity of a graph and the multiplicity of zero “2” of its chromatic polynomial 👍 👎
• Maximal chromatic polynomials of connected planar graphs 👍 👎
• Maximal σ‐polynomials of connected 3‐chromatic graphs 👍 👎
• Structures and chromaticity of extremal 3-colourable sparse graphs 👍 👎

This page was built for publication: