Coloring (4K1,C4,C6)-free graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F23%3A10476449" target="_blank" >RIV/00216208:11320/23:10476449 - isvavai.cz</a>
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=lyW.QOa0Ps" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=lyW.QOa0Ps</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.disc.2022.113225" target="_blank" >10.1016/j.disc.2022.113225</a>
Alternative languages
Result language
angličtina
Original language name
Coloring (4K1,C4,C6)-free graphs
Original language description
(4K(1),C-4,C-6)-free graphs are precisely the even-hole-free graphs of stability number at most three. We show that (4K(1),C-4,C-6)-free graphs can be recognized in (n(3)) time, and furthermore, that all the following can be computed in (n(3)) time for such graphs: an optimal coloring, a minimum clique cover, and the list of all maximal cliques. We also show that every (4K(1),C-4,C-6)-free graph on n vertices has at most n maximal cliques.@2022 Elsevier B V All rights reserved.
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
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2023
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
Discrete Mathematics
ISSN
0012-365X
e-ISSN
1872-681X
Volume of the periodical
346
Issue of the periodical within the volume
11
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
34
Pages from-to
113225
UT code for WoS article
001071234700001
EID of the result in the Scopus database
2-s2.0-85140641646