A Note on Coloring (4K(1), C-4, C-6)-Free Graphs with a C-7

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F22%3A10455313" target="_blank" >RIV/00216208:11320/22:10455313 - isvavai.cz</a>
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=3vhUxQ2jWV" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=3vhUxQ2jWV</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s00373-022-02553-4" target="_blank" >10.1007/s00373-022-02553-4</a>

Result language
angličtina
Original language name
A Note on Coloring (4K(1), C-4, C-6)-Free Graphs with a C-7
Original language description
Even-hole-free graphs are a graph class of much interest. Foley et al. (Graphs Comb. 36(1):125-138, 2020) have recently studied (4K(1), C-4, C-6)-free graphs, which form a subclass of even-hole-free graphs. Specifically, Foley et al. have shown an algorithm for coloring these graphs via bounded clique-width if they contain a C-7. In this note, we give a simpler and much faster algorithm via a more restrictive graph parameter, neighborhood diversity.
Czech name
—
Czech description
—

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)

Project
<a href="/en/project/GX19-27871X" target="_blank" >GX19-27871X: Efficient approximation algorithms and circuit complexity</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Similar results(10)