Restraints permitting the largest number of colourings

DOI10.1016/j.dam.2017.01.022zbMath1396.05038arXiv1611.09536OpenAlexW2559029563MaRDI QIDQ1786873

Aysel Erey, Jason I. Brown

Publication date: 25 September 2018

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

Full work available at URL: https://arxiv.org/abs/1611.09536

zbMATH Keywords

bipartite graphgraph colouringchromatic polynomialrestrained chromatic polynomialrestraint

Mathematics Subject Classification ID

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

Related Items (2)

A broken cycle theorem for the restrained chromatic function ⋮ Maximum number of colourings: 4-chromatic graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• When does the list-coloring function of a graph equal its chromatic polynomial
• Graph coloring satisfying restraints
• The chromatic polynomial and list colorings
• Interval vertex-coloring of a graph with forbidden colors
• Colour-critical graphs and hypergraphs
• On the number of list‐colorings
• Graph colorings with local constraints -- a survey
• Extremal Restraints for Graph Colourings
• Amenable colorings

This page was built for publication: Restraints permitting the largest number of colourings