Deciding k-Colorability of P 5-Free Graphs in Polynomial Time

Authors:
Chính T. Hoàng;Marcin Kamiński;Vadim Lozin;Joe Sawada;Xiao Shu
Affiliations:
Wilfrid Laurier University, Physics and Computer Science, 75 University Avenue West, N2L 3C5, Waterloo, Ontario, Canada;Rutgers University, RUTCOR, 640 Bartholomew Road, 08854, Piscataway, NJ, USA;University of Warwick, DIMAP and Mathematics Institute, CV4 7AL, Coventry, UK;University of Guelph, Computing and Information Science, Guelph, Canada;University of Guelph, Computing and Information Science, Guelph, Canada
Venue:
Algorithmica - Including a Special Section on Genetic and Evolutionary Computation; Guest Editors: Benjamin Doerr, Frank Neumann and Ingo Wegener
Year:
2010

Citing 0
Cited 18

Partitioning Graphs into Connected Parts

CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
A Certifying Algorithm for 3-Colorability of P5-Free Graphs

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
First-Fit coloring of {P5,K4-e}-free graphs

Discrete Applied Mathematics
Narrowing down the gap on the complexity of coloring Pk-free graphs

WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Colouring vertices of triangle-free graphs

WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Coloring graphs without short cycles and long induced paths

FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Updating the complexity status of coloring graphs without a fixed induced linear forest

Theoretical Computer Science
Determining the chromatic number of triangle-free 2P3-free graphs in polynomial time

Theoretical Computer Science
List coloring in the absence of a linear forest

WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
4-coloring h-free graphs when h is small

SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
On the parameterized complexity of coloring graphs in the absence of a linear forest

Journal of Discrete Algorithms
4-coloring H-free graphs when H is small

Discrete Applied Mathematics
Three complexity results on coloring Pk-free graphs

European Journal of Combinatorics
Choosability on H-free graphs

Information Processing Letters
Recognizing 3-colorings cycle-patterns on graphs

Pattern Recognition Letters
Data reduction for graph coloring problems

Information and Computation
Colouring of graphs with Ramsey-type forbidden subgraphs

Theoretical Computer Science
Coloring graphs without short cycles and long induced paths

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe space-efficient algorithms for solving problems related to finding maxima among points in two and three dimensions. Our algorithms run in optimal $\mathcal{O}(n\log n)$time and occupy only constant extra space in addition to the space needed ...