R. Belmonte
Characterizing graphs of small carving-width
Belmonte, R.; Hof, van 't P.; Kaminski, M.; Paulusma, D.; Thilikos, D.M.
Authors
van 't P. Hof
M. Kaminski
Professor Daniel Paulusma daniel.paulusma@durham.ac.uk
Professor
D.M. Thilikos
Abstract
We characterize all graphs that have carving-width at most k for k=1,2,3. In particular, we show that a graph has carving-width at most 3 if and only if it has maximum degree at most 3 and treewidth at most 2. This enables us to identify the immersion obstruction set for graphs of carving-width at most 3.
Citation
Belmonte, R., Hof, V. '. P., Kaminski, M., Paulusma, D., & Thilikos, D. (2013). Characterizing graphs of small carving-width. Discrete Applied Mathematics, 161(13-14), 1888-1893. https://doi.org/10.1016/j.dam.2013.02.036
Journal Article Type | Article |
---|---|
Publication Date | Sep 1, 2013 |
Deposit Date | Dec 20, 2014 |
Publicly Available Date | Mar 28, 2024 |
Journal | Discrete Applied Mathematics |
Print ISSN | 0166-218X |
Publisher | Elsevier |
Peer Reviewed | Peer Reviewed |
Volume | 161 |
Issue | 13-14 |
Pages | 1888-1893 |
DOI | https://doi.org/10.1016/j.dam.2013.02.036 |
Keywords | Immersion, Carving-width, Obstruction set. |
Public URL | https://durham-repository.worktribe.com/output/1415088 |
Files
Accepted Journal Article
(283 Kb)
PDF
Copyright Statement
NOTICE: this is the author’s version of a work that was accepted for publication in Discrete applied mathematics. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Discrete applied mathematics, 161, 13-14, 2013, 10.1016/j.dam.2013.02.036
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
An algorithmic framework for locally constrained homomorphisms
(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
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