Pages that link to "Item:Q646721"
From MaRDI portal
The following pages link to Complexity results for equistable graphs and related classes (Q646721):
Displaying 7 items.
- Strong cliques and equistability of EPT graphs (Q260014) (← links)
- Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs (Q477326) (← links)
- Short proofs on the structure of general partition, equistable and triangle graphs (Q1983105) (← links)
- Equistable simplicial, very well-covered, and line graphs (Q2448905) (← links)
- Recognizing k-equistable Graphs in FPT Time (Q2827831) (← links)
- Equistarable Graphs and Counterexamples to Three Conjectures on Equistable Graphs (Q2978190) (← links)
- Linear separation of connected dominating sets in graphs (Q5225055) (← links)