Distance constraints in graph color extensions
type: Item
instance of: scholarly article
title: Distance constraints in graph color extensions
zbMATH Open document ID: 1117.05042
author: Joan P. Hutchinson
author: Emily H. Moore
published in: Journal of Combinatorial Theory. Series B
publication date: 2007-06-08T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 5162674
zbMATH Keywords: precoloring extension
zbMATH Keywords: Hadwiger's conjecture
zbMATH Keywords: list-coloring
zbMATH Keywords: block design
MaRDI profile type: Publication
full work available at URL: j.jctb.2006.08.003
OpenAlex ID: W1988281057
cites work: You can't paint yourself into a corner
cites work: Extending colorings of locally planar graphs
cites work: Graph color extensions: When Hadwiger's conjecture and embeddings help
cites work: Extending precolorings of subgraphs of locally planar graphs
cites work: Extending graph colorings
cites work: Extending graph colorings using no extra colors
cites work: Precoloring Extensions of Brooks' Theorem
cites work: Extending precolorings to circular colorings
cites work: Every planar map is four colorable
cites work: A note on graph coloring extensions and list-colorings
cites work: Precoloring extension. I: Interval graphs
cites work: Q4342632
cites work: A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
cites work: Q3922703
cites work: Q5837979
cites work: Q4838466
cites work: Precoloring Extension III: Classes of Perfect Graphs
cites work: 25 pretty graph colouring problems
cites work: Q4882549
cites work: Hadwiger's conjecture for \(K_ 6\)-free graphs
cites work: The four-colour theorem
cites work: Color-critical graphs on a fixed surface
cites work: Graph colorings with local constraints -- a survey
cites work: A note on planar 5-list colouring: Non-extendability at distance 4
cites work: List colourings of planar graphs
DOI: 10.1016/J.JCTB.2006.08.003
description: scientific article; zbMATH DE number 5162674