A sharp lower bound on the number of non-equivalent colorings of graphs of order \(n\) and maximum degree \(n - 3\)
type: Item
instance of: scholarly article
title: A sharp lower bound on the number of non-equivalent colorings of graphs of order \(n\) and maximum degree \(n - 3\)
zbMATH Open document ID: 1376.05044
author: Romain Absil
author: Eglantine Camby
author: Alain Hertz
author: Hadrien Mélot
published in: Discrete Applied Mathematics
publication date: 2017-12-20T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C07
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 6820599
zbMATH Keywords: non-equivalent colorings
zbMATH Keywords: graphical Bell number
zbMATH Keywords: extremal theory
zbMATH Keywords: fixed maximum degree
Wikidata QID: Q60692141
describes a project that uses: OEIS
describes a project that uses: GraPHedron
MaRDI profile type: Publication
full work available at URL: j.dam.2016.06.025
OpenAlex ID: W2245479836
cites work: Expansions of Chromatic Polynomials and Log-Concavity
cites work: Location of Zeros of Chromatic and Related Polynomials of Graphs
cites work: Q4947393
cites work: Q5313291
cites work: Q2995169
cites work: Q3550089
cites work: Stirling numbers of forests and cycles
cites work: Counting the number of non-equivalent vertex colorings of a graph
cites work: Stirling numbers of the second kind and Bell numbers for graphs
cites work: \(\sigma\)-polynomials and graph coloring
cites work: Facet defining inequalities among graph invariants: The system graphedron
cites work: Q4443440
DBLP publication ID: journals/dam/AbsilCHM18
DOI: 10.1016/J.DAM.2016.06.025
Recommended article: Upper bounds on the average number of colors in the non-equivalent colorings of a graph
Recommended article: Lower bounds and properties for the average number of colors in the non-equivalent colorings of a graph
Recommended article: Equitable total coloring of graphs with maximum degree 3
Recommended article: Counting the number of non-equivalent vertex colorings of a graph
Recommended article: Some new bounds for the maximum number of vertex colorings of a (v,e)-graph
Recommended article: Q4483917
Recommended article: On the lower bound for the chromatic number of graphs with given maximal degree and girth
Recommended article: Coloring 3-Colorable Graphs with Less than n 1/5 Colors
Recommended article: The maximum number of colorings of graphs of given order and size: a survey
Recommended article: The incidence coloring conjecture for graphs of maximum degree 3
description: scientific article; zbMATH DE number 6820599