The following pages link to (Q6065396):
Displaying 7 items.
- Well-partitioned chordal graphs (Q2144581) (← links)
- Three problems on well-partitioned chordal graphs (Q2692718) (← links)
- On the approximation hardness of geodetic set and its variants (Q2695276) (← links)
- Algorithms and complexity for geodetic sets on partial grids (Q6057850) (← links)
- Maximum cut on interval graphs of interval count four is NP-complete (Q6124829) (← links)
- Monitoring edge-geodetic sets in graphs: extremal graphs, bounds, complexity (Q6547818) (← links)
- Semi-proper interval graphs (Q6648246) (← links)
