AI Chat AI Image Generator AI Video AI Music Generator

Polynomial Cases for the Vertex Coloring Problem

09/22/2017

∙

by T. Karthick, et al.

∙

∙

The computational complexity of the Vertex Coloring problem is known for all hereditary classes of graphs defined by forbidding two connected five-vertex induced subgraphs, except for seven cases. We prove the polynomial-time solvability of four of these problems: for (P_5, dart)-free graphs, (P_5, banner)-free graphs, (P_5, bull)-free graphs, and (fork, bull)-free graphs.

T. Karthick
9 publications
Frédéric Maffray
3 publications
Lucas Pastor
3 publications

page 1

page 2

page 3

page 4

research

∙ 11/12/2020

Note on 3-Coloring of (2P_4,C_5)-Free Graphs

We show that the 3-coloring problem is polynomial-time solvable on (2P_4...

0 Vít Jelínek, et al. ∙

research

∙ 03/27/2020

Covering minimal separators and potential maximal cliques in P_t-free graphs

A graph is called P_t-free if it does not contain a t-vertex path as an ...

0 Andrzej Grzesik, et al. ∙

research

∙ 10/19/2017

On vertex coloring without monochromatic triangles

We study a certain relaxation of the classic vertex coloring problem, na...

0 Michał Karpiński, et al. ∙

research

∙ 10/02/2018

Reconfiguring Graph Homomorphisms on the Sphere

Given a loop-free graph H, the reconfiguration problem for homomorphisms...

0 Jae-Baek Lee, et al. ∙

research

∙ 05/27/2020

On motifs in colored graphs

One of the most important concepts in biological network analysis is tha...

0 Diego P Rubert, et al. ∙

research

∙ 02/07/2018

Four-coloring P_6-free graphs. II. Finding an excellent precoloring

This is the second paper in a series of two. The goal of the series is t...

0 Maria Chudnovsky, et al. ∙

research

∙ 02/27/2018

Role colouring graphs in hereditary classes

We study the computational complexity of computing role colourings of gr...

0 Christopher Purcell, et al. ∙