Acyclic, star and injective colouring: A complexity picture for H-free graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F25%3A10515256" target="_blank" >RIV/00216208:11320/25:10515256 - isvavai.cz</a>
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=mMWykZ3uZI" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=mMWykZ3uZI</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.jcss.2025.103662" target="_blank" >10.1016/j.jcss.2025.103662</a>
Alternative languages
Result language
angličtina
Original language name
Acyclic, star and injective colouring: A complexity picture for H-free graphs
Original language description
A (proper) colouring is acyclic, star, or injective if any two colour classes induce a forest, star forest or disjoint union of vertices and edges, respectively. The corresponding decision problems are ACYCLIC COLOURING, STAR COLOURING and INJECTIVE COLOURING. We give almost complete complexity classifications for ACYCLIC COLOURING, STAR COLOURING and INJECTIVE COLOURING on H-free graphs (for each of the problems, we have one open case). Moreover, we give full complexity classifications if the number of colours k is fixed, that is, not part of the input. From our study it follows that for fixed k, the three problems behave in the same way, but this is no longer true if k is part of the input. To obtain several of our results we prove stronger complexity results that in particular involve the girth of a graph and the class of line graphs of multigraphs.
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
S - Specificky vyzkum na vysokych skolach<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2025
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
Journal of Computer and System Sciences
ISSN
0022-0000
e-ISSN
1090-2724
Volume of the periodical
154
Issue of the periodical within the volume
December 2025
Country of publishing house
US - UNITED STATES
Number of pages
18
Pages from-to
103662
UT code for WoS article
001492605500001
EID of the result in the Scopus database
2-s2.0-105004878641