Pages that link to "Item:Q412344"
From MaRDI portal
The following pages link to Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences (Q412344):
Displaying 12 items.
- Weighted independent sets in classes of \(P_6\)-free graphs (Q298979) (← links)
- On atomic structure of \(P_5\)-free subclasses and maximum weight independent set problem (Q385962) (← links)
- Organizing the atoms of the clique separator decomposition into an atom tree (Q406311) (← links)
- Maximum weight independent sets in odd-hole-free graphs without dart or without bull (Q497314) (← links)
- Maximum weight independent sets in hole- and dart-free graphs (Q714022) (← links)
- Weighted independent sets in a subclass of \(P_6\)-free graphs (Q906493) (← links)
- Approximation of knapsack problems with conflict and forcing graphs (Q2012887) (← links)
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds (Q2341752) (← links)
- One-three join: a graph operation and its consequences (Q2364085) (← links)
- Colouring diamond-free graphs (Q2402373) (← links)
- On the chromatic number of (\(P_6\), diamond)-free graphs (Q2413634) (← links)
- Maximum Weight Independent Sets in ( $$S_{1,1,3}$$ , bull)-free Graphs (Q2817880) (← links)
