Independent sets in some classes of $S_{i,j,k}$-free graphs

DOI10.1007/s10878-016-0096-7zbMath1407.90326OpenAlexW2552678279MaRDI QIDQ2410110

Publication date: 17 October 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-016-0096-7

zbMATH Keywords

graph algorithms independent sets claw-free graphs fork-free graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (2)

Parameterized Complexity of Independent Set in H-Free Graphs. ⋮ Parameterized complexity of independent set in H-free graphs

Cites Work

Unnamed Item
Unnamed Item
Weighted independent sets in classes of $P_6$-free graphs
The maximum independent set problem in subclasses of $S_{i, j, k}$-free graphs
Maximum weight independent sets in classes related to claw-free graphs
On atomic structure of $P_5$-free subclasses and maximum weight independent set problem
Addendum to: ``Maximum weight independent sets in hole- and co-chair-free graphs
Maximum weight independent sets in odd-hole-free graphs without dart or without bull
The complexity of generalized clique packing
On diameters and radii of bridged graphs
On maximal independent sets of vertices in claw-free graphs
Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
The ellipsoid method and its consequences in combinatorial optimization
Stable sets in two subclasses of banner-free graphs
On ($P_{5}$, diamond)-free graphs
On the maximum independent set problem in subclasses of subcubic graphs
New sufficient conditions for $\alpha$-redundant vertices
On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
Independent Sets in Classes Related to Chair-Free Graphs
Maximum Weight Independent Sets in ( $$S_{1,1,3}$$ , bull)-free Graphs
A Linear Recognition Algorithm for Cographs
Independence and Efficient Domination on P₆-free Graphs
Classes of subcubic planar graphs for which the independent set problem is polynomially solvable
Independent Set in P₅-Free Graphs in Polynomial Time
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph

This page was built for publication: Independent sets in some classes of $S_{i,j,k}$-free graphs

Independent sets in some classes of \(S_{i,j,k}\)-free graphs