Independence number and maximal chromatic polynomials of connected graphs

DOI10.1007/S00373-024-02824-2zbMATH Open1548.05131MaRDI QIDQ6616432

Junliang Cai, Shude Long

Publication date: 9 October 2024

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

graph coloringindependence numberchromatic polynomial

Mathematics Subject Classification ID

Graph polynomials (05C31) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Conditions that a graph have a dual
• Maximum chromatic polynomial of 3-chromatic blocks
• A determinant formula for the number of ways of coloring a map.
• Maximizing the number of \(x\)-colorings of 4-chromatic graphs
• On the maximum number of colorings of a graph
• Extremal colorings and independent sets
• On the number of ways of colouring a map.
• New bounds for chromatic polynomials and chromatic roots
• A proof of Tomescu's graph coloring conjecture
• Le nombre maximal de 3-colorations d'un graphe connexe. (The maximal number of 3-colorations of a connected graph)
• Maximal chromatic polynomials of connected planar graphs
• Maximum chromatic polynomials of 2‐connected graphs
• Tomescu's Graph Coloring Conjecture for $\ell$-Connected Graphs
• Chromatic Polynomials
• Upper bounds on the chromatic polynomial of a connected graph with fixed clique number

This page was built for publication: Independence number and maximal chromatic polynomials of connected graphs

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