The following pages link to On uniquely intersectable graphs (Q1817570):
Displaying 5 items.
- Arboricity, \(h\)-index, and dynamic algorithms (Q418737) (← links)
- A generalization of Opsut's result on the competition numbers of line graphs (Q479034) (← links)
- Unique intersectability of diamond-free graphs (Q534340) (← links)
- Cube intersection concepts in median graphs (Q1025912) (← links)
- Computing square roots of trivially perfect and threshold graphs (Q2446337) (← links)
