E. Galby
Classifying k-Edge Colouring for H-free Graphs
Galby, E.; Lima, P.T.; Paulusma, D.; Ries, B.
Abstract
A graph is H-free if it does not contain an induced subgraph isomorphic to H. For every integer k and every graph H, we determine the computational complexity of k-Edge Colouring for H-free graphs.
Citation
Galby, E., Lima, P., Paulusma, D., & Ries, B. (2019). Classifying k-Edge Colouring for H-free Graphs. Information Processing Letters, 146, 39-43. https://doi.org/10.1016/j.ipl.2019.02.006
Journal Article Type | Article |
---|---|
Acceptance Date | Feb 18, 2019 |
Online Publication Date | Feb 20, 2019 |
Publication Date | Jun 1, 2019 |
Deposit Date | Feb 22, 2019 |
Publicly Available Date | Feb 20, 2020 |
Journal | Information Processing Letters |
Print ISSN | 0020-0190 |
Publisher | Elsevier |
Peer Reviewed | Peer Reviewed |
Volume | 146 |
Pages | 39-43 |
DOI | https://doi.org/10.1016/j.ipl.2019.02.006 |
Public URL | https://durham-repository.worktribe.com/output/1302469 |
Files
Accepted Journal Article
(369 Kb)
PDF
Publisher Licence URL
http://creativecommons.org/licenses/by-nc-nd/4.0/
Copyright Statement
© 2019 This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/
You might also like
Matching cuts in graphs of high girth and H-free graphs
(2023)
Conference Proceeding
Solving problems on generalized convex graphs via mim-width
(2023)
Journal Article
On the price of independence for vertex cover, feedback vertex set and odd cycle transversal
(2023)
Journal Article
Computing Subset Vertex Covers in H-Free Graphs
(2023)
Conference Proceeding
Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius
(2023)
Conference Proceeding
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