P.A. Golovach
Squares of low clique number
Golovach, P.A.; Kratsch, D.; Paulusma, D.; Stewart, A.
Abstract
The Square Root problem is that of deciding whether a given graph admits a square root. This problem is only known to be NP-complete for chordal graphs and polynomial-time solvable for non-trivial minor-closed graph classes and a very limited number of other graph classes. By researching boundedness of the treewidth of a graph, we prove that Square Root is polynomial-time solvable on various graph classes of low clique number that are not minor-closed.
Citation
Golovach, P., Kratsch, D., Paulusma, D., & Stewart, A. (2016). Squares of low clique number. Electronic Notes in Discrete Mathematics, 55, 195-198. https://doi.org/10.1016/j.endm.2016.10.048
Journal Article Type | Conference Paper |
---|---|
Conference Name | 14th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW16) |
Conference Location | Gargnano, Italy |
Acceptance Date | Mar 29, 2016 |
Online Publication Date | Nov 17, 2016 |
Publication Date | Nov 17, 2016 |
Deposit Date | Dec 11, 2016 |
Publicly Available Date | Nov 17, 2017 |
Journal | Electronic Notes in Discrete Mathematics |
Print ISSN | 1571-0653 |
Publisher | Elsevier |
Peer Reviewed | Peer Reviewed |
Volume | 55 |
Pages | 195-198 |
Series Title | Electronic Notes in Discrete Mathematics |
DOI | https://doi.org/10.1016/j.endm.2016.10.048 |
Public URL | https://durham-repository.worktribe.com/output/1148412 |
Files
Accepted Journal Article
(272 Kb)
PDF
Publisher Licence URL
http://creativecommons.org/licenses/by-nc-nd/4.0/
Copyright Statement
© 2016 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