Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/213
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Radovanović, Marko | en_US |
dc.contributor.author | Trotignon, Nicolas | en_US |
dc.contributor.author | Vušković, Kristina | en_US |
dc.date.accessioned | 2022-08-06T17:23:28Z | - |
dc.date.available | 2022-08-06T17:23:28Z | - |
dc.date.issued | 2020-07-01 | - |
dc.identifier.issn | 00958956 | en |
dc.identifier.uri | https://research.matf.bg.ac.rs/handle/123456789/213 | - |
dc.description.abstract | A hole in a graph is a chordless cycle of length at least 4. A theta is a graph formed by three paths between the same pair of distinct vertices so that the union of any two of the paths induces a hole. A wheel is a graph formed by a hole and a vertex that has at least 3 neighbors in the hole. In this series of papers we study the class of graphs that do not contain as an induced subgraph a theta nor a wheel. In Part II of the series we prove a decomposition theorem for this class, that uses clique cutsets and 2-joins, and consequently obtain a polynomial time recognition algorithm for the class. In this paper we further use this decomposition theorem to obtain polynomial time algorithms for maximum weight clique, maximum weight stable set and coloring problems. We also show that for a graph G in the class, if its maximum clique size is ω, then its chromatic number is bounded by max{ω,3}, and that the class is 3-clique-colorable. | en |
dc.relation.ispartof | Journal of Combinatorial Theory. Series B | en |
dc.subject | Algorithm | en |
dc.subject | Clique | en |
dc.subject | Clique-coloring | en |
dc.subject | Stable set | en |
dc.subject | Theta | en |
dc.subject | Truemper configuration | en |
dc.subject | Vertex-coloring | en |
dc.subject | Wheel | en |
dc.title | The (theta, wheel)-free graphs Part III: Cliques, stable sets and coloring | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1016/j.jctb.2019.07.003 | - |
dc.identifier.scopus | 2-s2.0-85069005224 | - |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/85069005224 | - |
dc.contributor.affiliation | Algebra and Mathematical Logic | en_US |
dc.relation.firstpage | 185 | en |
dc.relation.lastpage | 218 | en |
dc.relation.volume | 143 | en |
item.fulltext | No Fulltext | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.cerifentitytype | Publications | - |
item.grantfulltext | none | - |
item.openairetype | Article | - |
crisitem.author.dept | Algebra and Mathematical Logic | - |
crisitem.author.orcid | 0000-0002-6990-1793 | - |
Appears in Collections: | Research outputs |
SCOPUSTM
Citations
3
checked on Dec 20, 2024
Page view(s)
11
checked on Dec 24, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.