C. Brause
Acyclic, star and injective colouring: bounding the diameter
Brause, C.; Golovach, P.A.; Martin, B.; Paulusma, D.; Smith, S.
Authors
P.A. Golovach
Dr Barnaby Martin barnaby.d.martin@durham.ac.uk
Associate Professor
Professor Daniel Paulusma daniel.paulusma@durham.ac.uk
Professor
Siani Smith siani.smith@durham.ac.uk
PGR Student Doctor of Philosophy
Contributors
Łukasz Kowalik
Editor
Michał Pilipczuk
Editor
Paweł Rzążewski
Editor
Abstract
We examine the effect of bounding the diameter for wellstudied variants of the Colouring problem. A 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. The last problem is also known as L(1, 1)-Labelling and we also consider the framework of L(a, b)-Labelling. We prove a number of (almost-)complete complexity classifications, in particular, for Acyclic 3-Colouring, Star 3-Colouring and L(1, 2)-Labelling
Citation
Brause, C., Golovach, P., Martin, B., Paulusma, D., & Smith, S. Acyclic, star and injective colouring: bounding the diameter
Presentation Conference Type | Conference Paper (Published) |
---|---|
Acceptance Date | Apr 28, 2021 |
Online Publication Date | Sep 20, 2021 |
Publication Date | 2021 |
Deposit Date | May 28, 2021 |
Publicly Available Date | Aug 24, 2021 |
Print ISSN | 0302-9743 |
Publisher | Springer Verlag |
Volume | 12911 |
Pages | 336-348 |
Series Title | Lecture Notes in Computer Science |
Series ISSN | 0302-9743 |
Edition | 1 |
Book Title | Graph-Theoretic Concepts in Computer Science: 47th International Workshop, WG 2021, Warsaw, Poland, June 23–25, 2021, Revised Selected Papers |
ISBN | 9783030868376 |
DOI | https://doi.org/10.1007/978-3-030-86838-3_26 |
Public URL | https://durham-repository.worktribe.com/output/1653973 |
Files
Accepted Book Chapter
(301 Kb)
PDF
Copyright Statement
The final authenticated version is available online at https://doi.org/10.1007/978-3-030-86838-3_26
You might also like
Computing balanced solutions for large international kidney exchange schemes
(2024)
Journal Article
An Algorithmic Framework for Locally Constrained Homomorphisms
(2024)
Journal Article
Matching cuts in graphs of high girth and H-free graphs
(2023)
Presentation / Conference Contribution
Solving problems on generalized convex graphs via mim-width
(2023)
Journal Article
Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius
(2023)
Presentation / Conference Contribution
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search