H.J. Broersma
Computing sharp 2-factors in claw-free graphs
Broersma, H.J.; Paulusma, D.
Abstract
In a previous paper we obtained an upper bound for the minimum number of components of a 2-factor in a claw-free graph. This bound is sharp in the sense that there exist infinitely many claw-free graphs for which the bound is tight. In this paper we extend these results by presenting a polynomial algorithm that constructs a 2-factor of a claw-free graph with minimum degree at least four whose number of components meets this bound. As a byproduct we show that the problem of obtaining a minimum 2-factor (if it exists) is polynomially solvable for a subclass of claw-free graphs. As another byproduct we give a short constructive proof for a result of Ryjáček, Saito and Schelp.
Citation
Broersma, H., & Paulusma, D. (2010). Computing sharp 2-factors in claw-free graphs. Journal of discrete algorithms, 8(3), 321-329. https://doi.org/10.1016/j.jda.2009.07.001
Journal Article Type | Article |
---|---|
Publication Date | Sep 1, 2010 |
Deposit Date | Oct 6, 2010 |
Publicly Available Date | Oct 7, 2010 |
Journal | Journal of Discrete Algorithms |
Print ISSN | 1570-8667 |
Publisher | Elsevier |
Peer Reviewed | Peer Reviewed |
Volume | 8 |
Issue | 3 |
Pages | 321-329 |
DOI | https://doi.org/10.1016/j.jda.2009.07.001 |
Keywords | Claw-free graph, 2-factor, Number of components, Polynomial algorithm. |
Public URL | https://durham-repository.worktribe.com/output/1538921 |
Files
Accepted Journal Article
(187 Kb)
PDF
Copyright Statement
NOTICE: this is the author's version of a work that was accepted for publication in Journal of discrete algorithms.
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