Precoloring extension involving pairs of vertices of small distance

DOI10.1016/j.dam.2013.10.012zbMath1283.05109arXiv1308.3037MaRDI QIDQ2636808

Akira Saito, Chihoko Ojima, Kazuki Sano

Publication date: 18 February 2014

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

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

zbMATH Keywords

distance; coloring; precoloring

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

05C12: Distance in graphs

Related Items

Unnamed Item, Precoloring extension involving pairs of vertices of small distance

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• List colourings of planar graphs
• Graph color extensions: When Hadwiger's conjecture and embeddings help
• Distance constraints in graph color extensions
• Precoloring extension for 2-connected graphs with maximum degree three
• You can't paint yourself into a corner
• Extending graph colorings
• A note on planar 5-list colouring: Non-extendability at distance 4
• Extending precolorings to circular colorings
• Precoloring extension involving pairs of vertices of small distance
• Extending colorings of locally planar graphs
• Graph colorings with local constraints -- a survey
• Precoloring Extension III: Classes of Perfect Graphs
• Precoloring Extensions of Brooks' Theorem
• Precoloring Extension for 2‐connected Graphs
• Extending graph colorings using no extra colors