Reconfiguration graph for vertex colourings of weakly chordal graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F19%3A10403671" target="_blank" >RIV/00216208:11320/19:10403671 - isvavai.cz</a>
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=MYbEtyh6Z4" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=MYbEtyh6Z4</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Reconfiguration graph for vertex colourings of weakly chordal graphs
Original language description
We show that for each k>=3 there is a k-colourable weakly chordal graph G such that the reconfiguration graph R_k+1(G) is disconnected. We also introduce a subclass of k-colourable weakly chordal graphs and show that their reconfiguration graphs have quadratic diameter.
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
10101 - Pure mathematics
Result continuities
Project
<a href="/en/project/GA17-09142S" target="_blank" >GA17-09142S: Modern algorithms: New challenges of complex data sets</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2019
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
Acta Mathematica Universitatis Comenianae
ISSN
0862-9544
e-ISSN
—
Volume of the periodical
88
Issue of the periodical within the volume
3
Country of publishing house
SK - SLOVAKIA
Number of pages
5
Pages from-to
667-671
UT code for WoS article
000484349000048
EID of the result in the Scopus database
2-s2.0-85073792855