English

Deciding the On-line Chromatic Number of a Graph with Pre-Coloring is PSPACE-Complete

Computational Complexity 2014-06-09 v1 Combinatorics
Authors: Christian Kudahl
View on arXiv ↗ PDF ↗

Abstract

The problem of determining if the on-line chromatic number of a graph is less than or equal to k, given a pre-coloring, is shown to be PSPACE-complete.

Keywords

on-line chromatic number pre-coloring PSPACE-complete graph coloring computational complexity

Cite

@article{arxiv.1406.1623,
  title  = {Deciding the On-line Chromatic Number of a Graph with Pre-Coloring is PSPACE-Complete},
  author = {Christian Kudahl},
  journal= {arXiv preprint arXiv:1406.1623},
  year   = {2014}
}

Related papers

View all related →
Computational Complexity · Computer Science
Online Chromatic Number is PSPACE-Complete
Martin Böhm, Pavel Veselý
2017-06-27
Computational Complexity · Computer Science
A Survey on the Computational Complexity of Colouring Graphs with Forbidden Subgraphs
Petr A. Golovach, Matthew Johnson, Daniël Paulusma, Jian Song
2016-02-16
Data Structures and Algorithms · Computer Science
On-line approach to off-line coloring problems on graphs with geometric representations
Tomasz Krawczyk, Bartosz Walczak
2016-12-30
Combinatorics · Mathematics
Packing chromatic number of subcubic graphs
József Balogh, Alexandr Kostochka, Xujun Liu
2017-03-31
Data Structures and Algorithms · Computer Science
Deciding k-colourability of $P_5$-free graphs in polynomial time
Chính T. Hoàng, Marcin Kamiński, Vadim Lozin, J. Sawada +1
2016-08-14
Combinatorics · Mathematics
Clustered colouring of graph classes with bounded treedepth or pathwidth
Sergey Norin, Alex Scott, David R. Wood
2022-01-24
Combinatorics · Mathematics
Total Colourings of Direct Product Graphs
Jeannette Janssen, Kyle MacKeigan
2020-08-06
Combinatorics · Mathematics
Separating the online and offline DP-chromatic numbers
Peter Bradshaw
2022-09-21
Combinatorics · Mathematics
Compelling Colorings: A generalization of the dominator chromatic number
Anna Bachstein, Wayne Goddard, Michael A. Henning, John Xue
2021-05-11
Combinatorics · Mathematics
Complexity of the Game Domination Problem
Boštjan Brešar, Paul Dorbec, Sandi Klavžar, Gašper Košmrlj +1
2016-06-20
Data Structures and Algorithms · Computer Science
The List Coloring Reconfiguration Problem for Bounded Pathwidth Graphs
Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
2016-01-20
Combinatorics · Mathematics
On color-critical ($P_{5},\overline{P}_5$)-free graphs
Harjinder S. Dhaliwal, Angèle M. Hamel, Chính T. Hoàng, Frédéric Maffray +2
2014-12-01
Data Structures and Algorithms · Computer Science
Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters
Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou
2017-05-23
Combinatorics · Mathematics
Graph Coloring as a Measure of Network Vulnerability
Mia Destefano, Grace Mulry, Mason Nakamura, Rodrigo Rios +1
2022-12-05
General Mathematics · Mathematics
Chromatic Completion Number
E. G Mphako-Banda, J. Kok
2018-09-06
Combinatorics · Mathematics
On-Line Choice Number of Complete Multipartite Graphs: an Algorithmic Approach
Fei-Huang Chang, Hong-Bin Chen, Jun-Yi Guo, Yu-Pei Huang
2014-12-18
Discrete Mathematics · Computer Science
The coloring problem for $\{P_5,\bar{P_5}\}$-free graphs and $\{P_5,K_p-e\}$-free graphs is polynomial
D. S. Malyshev, O. O. Lobanova
2015-03-10
Combinatorics · Mathematics
Colouring Lines in Projective Space
Ameera Chowdhury, Chris Godsil, Gordon Royle
2007-05-23
Discrete Mathematics · Computer Science
The Complexity of (List) Edge-Coloring Reconfiguration Problem
Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou
2016-09-02
Combinatorics · Mathematics
On Criticality and Additivity of the Pseudoachromatic Number Under Join
Jonathan Meddaugh, Mark R. Sepanski, Yegnanarayanan Venkataraman
2024-08-30
Computational Complexity · Computer Science
Narrowing the Complexity Gap for Colouring ($C_s$,$P_t$)-Free Graphs
Shenwei Huang, Matthew Johnson, Daniël Paulusma
2014-07-08
Data Structures and Algorithms · Computer Science
Approximation Algorithms for Partially Colorable Graphs
Suprovat Ghoshal, Anand Louis, Rahul Raychaudhury
2019-09-02
Combinatorics · Mathematics
Total Colourings - A survey
Geetha Jayabalan, Narayanan N, K Somasundaram
2018-12-17
Combinatorics · Mathematics
On Star Coloring of Splitting Graphs
Hanna Furmańczyk, Kowsalya V, Vernold Vivin J
2017-05-29
Computational Complexity · Computer Science
On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two
Elaine M. Eschen, Chinh T. Hoang, R. Sritharan, Lorna Stewart
2009-07-06