The following pages link to (Q3595114):
Displaying 8 items.
- NP-hardness of the recognition of coordinated graphs (Q839773) (← links)
- Partial characterizations of coordinated graphs: Line graphs and complements of forests (Q1014303) (← links)
- Neighborhood covering and independence on \(P_4\)-tidy graphs and tree-cographs (Q2178334) (← links)
- On some graph classes related to perfect graphs: a survey (Q2184662) (← links)
- Edge contraction and edge removal on iterated clique graphs (Q2446322) (← links)
- NP-completeness results for edge modification problems (Q2500532) (← links)
- Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs (Q5900083) (← links)
- Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs (Q5900860) (← links)
