Stable Sets in {ISK₄,wheel}-Free Graphs

Abstract

An ISK4 in a graph G is an induced subgraph of G that is isomorphic to a subdivision of K₄ (the complete graph on four vertices). A wheel is a graph that consists of a chordless cycle, together with a vertex that has at least three neighbors in the cycle. A graph is {ISK₄,wheel}-free if it has no ISK₄ and does not contain a wheel as an induced subgraph. We give an O(|V(G)|⁷)-time algorithm to compute the maximum weight of a stable set in an input weighted {ISK₄,wheel}-free graph G with non-negative integer weights.

Metadata

Authors/Creators:	Milanič, M Penev, I Trotignon, N
Copyright, Publisher and Additional Information:	© 2017, The Author(s). This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
Dates:	Accepted: 17 November 2016 Published (online): 30 January 2017 Published: February 2018
Institution:	The University of Leeds
Academic Units:	The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds)
Depositing User:	Symplectic Publications
Date Deposited:	01 Nov 2017 10:57
Last Modified:	19 Mar 2018 14:20
Status:	Published
Publisher:	Springer
Identification Number:	https://doi.org/10.1007/s00453-016-0255-3

Download

Published Version

Filename: 10.1007_s00453-016-0255-3.pdf

Licence: CC-BY 4.0

CLICK TO DOWNLOAD

CORE (COnnecting REpositories)

Stable Sets in {ISK₄,wheel}-Free Graphs

Abstract

Metadata

Download

Published Version

Export

Statistics