Pages that link to "Item:Q2275391"
From MaRDI portal
The following pages link to On the complexity of the independent set problem in triangle graphs (Q2275391):
Displaying 7 items.
- Strong cliques and equistability of EPT graphs (Q260014) (← links)
- On equistable, split, CIS, and related classes of graphs (Q344829) (← links)
- Algorithm to find a maximum 2-packing set in a cactus (Q1748991) (← links)
- Short proofs on the structure of general partition, equistable and triangle graphs (Q1983105) (← links)
- Characterization of general position sets and its applications to cographs and bipartite graphs (Q2279405) (← links)
- Equistable simplicial, very well-covered, and line graphs (Q2448905) (← links)
- 1-Triangle graphs and perfect neighborhood sets (Q5269160) (← links)
