Colouring (P-r + P-s)-Free Graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F20%3A10421591" target="_blank" >RIV/00216208:11320/20:10421591 - isvavai.cz</a>
Alternative codes found
RIV/68407700:21240/20:00347507
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=0fbhhyLmtn" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=0fbhhyLmtn</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s00453-020-00675-w" target="_blank" >10.1007/s00453-020-00675-w</a>
Alternative languages
Result language
angličtina
Original language name
Colouring (P-r + P-s)-Free Graphs
Original language description
The k-Colouring problem is to decide if the vertices of a graph can be coloured with at most k colours for a fixed integer k such that no two adjacent vertices are coloured alike. If each vertex u must be assigned a colour from a prescribed list L(u). {1,., k}, then we obtain the List k-Colouring problem. A graph G is H-free if G does not contain H as an induced subgraph. We continue an extensive study into the complexity of these two problems for H-free graphs. The graph P r + P s is the disjoint union of the r-vertex path P r and the s-vertex path P s. We prove that List 3-Colouring is polynomial-time solvable for (P 2 + P 5)-free graphs and for (P 3 + P 4)-free graphs. Combining our results with known results yields complete complexity classifications of 3-Colouring and List 3-Colouring on H-free graphs for all graphs H up to seven vertices.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
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)
Others
Publication year
2020
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Algorithmica
ISSN
0178-4617
e-ISSN
—
Volume of the periodical
82
Issue of the periodical within the volume
7
Country of publishing house
US - UNITED STATES
Number of pages
26
Pages from-to
1833-1858
UT code for WoS article
000533891500004
EID of the result in the Scopus database
—