4-colorability of P(6)-free graphs

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F15%3A43926673" target="_blank" >RIV/49777513:23520/15:43926673 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1016/j.endm.2015.06.007" target="_blank" >http://dx.doi.org/10.1016/j.endm.2015.06.007</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.endm.2015.06.007" target="_blank" >10.1016/j.endm.2015.06.007</a>

Result language

angličtina

Original language name

4-colorability of P(6)-free graphs

Original language description

In this paper, we study complexity of the 4-colorability in subclasses of P(6)-free graphs. It is well-known that the 4-colorability problem is NP-complete in general. Recently, Huang conjectured that 4-colorability of P(6)-free graphs can be decided inpolynomial time. We show that this conjecture is true for the classes of (P(6), bull, Z(2))-free graphs, (P(6), bull, kite)-free graphs, and (P(6), chair)-free graphs.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2015

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Electronic Notes in Discrete Mathematics

ISSN

1571-0653

e-ISSN

—

Volume of the periodical

49

Issue of the periodical within the volume

listopad 2015

Country of publishing house

NL - THE KINGDOM OF THE NETHERLANDS

Number of pages

6

Pages from-to

37-42

UT code for WoS article

—

EID of the result in the Scopus database

—