Pages that link to "Item:Q839773"
From MaRDI portal
The following pages link to NP-hardness of the recognition of coordinated graphs (Q839773):
Displaying 4 items.
- Partial characterizations of coordinated graphs: Line graphs and complements of forests (Q1014303) (← links)
- Distinguishing graphs via cycles (Q2695304) (← 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)
