Extremal Restraints for Graph Colourings
From MaRDI portal
Publication:5500320
zbMath1321.05074arXiv1611.08920MaRDI QIDQ5500320
Jian Li, Aysel Erey, Jason I. Brown
Publication date: 5 August 2015
Full work available at URL: https://arxiv.org/abs/1611.08920
Related Items (4)
A broken cycle theorem for the restrained chromatic function ⋮ Restraints permitting the largest number of colourings ⋮ Maximum number of colourings: 5-chromatic case ⋮ Maximum number of colourings: 4-chromatic graphs
This page was built for publication: Extremal Restraints for Graph Colourings