Maximising ‐colourings of graphs

DOI10.1002/JGT.22446zbMath1425.05056arXiv1611.02911OpenAlexW2910637497WikidataQ128584924 ScholiaQ128584924MaRDI QIDQ5241611

Hannah Guggiari, Alexander D. Scott

Publication date: 31 October 2019

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

graph homomorphismminimum degree\(H\)-colouring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

Extremal colorings and independent sets ⋮ Tomescu's Graph Coloring Conjecture for $\ell$-Connected Graphs

This page was built for publication: Maximising ‐colourings of graphs