The following pages link to (Q3676177):
Displayed 23 items.
- An algorithm for finding homogeneous pairs (Q674438) (← links)
- An O(\(n\)) time algorithm for maximum matching on cographs (Q685476) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- On algorithms for (\(P_5\), gem)-free graphs (Q817767) (← links)
- New applications of clique separator decomposition for the maximum weight stable set problem (Q868954) (← links)
- Structure and stability number of chair-, co-P- and gem-free graphs revisited (Q1007592) (← links)
- Clustering and domination in perfect graphs (Q1068110) (← links)
- A linear time algorithm for the maximum matching problem on cographs (Q1314631) (← links)
- \(k\)-NLC graphs and polynomial algorithms (Q1336631) (← links)
- On semi-\(P_ 4\)-sparse graphs (Q1356751) (← links)
- Characterizations and algorithmic applications of chordal graph embeddings (Q1372739) (← links)
- On variations of \(P_{4}\)-sparse graphs (Q1406046) (← links)
- Stability number of bull- and chair-free graphs revisited (Q1408811) (← links)
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs (Q1414581) (← links)
- (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization. (Q1428548) (← links)
- On the structure of (\(P_{5}\),\,gem)-free graphs (Q1764802) (← links)
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width (Q1764808) (← links)
- Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time. (Q1853148) (← links)
- Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs (Q2384837) (← links)
- On the complexity of 4-coloring graphs without long induced paths (Q2465649) (← links)
- (Q2741466) (← links)
- Characterisations and Linear-Time Recognition of Probe Cographs (Q3508570) (← links)
- (Q4488859) (← links)