Pages that link to "Item:Q393888"
From MaRDI portal
The following pages link to (Nearly-)tight bounds on the contiguity and linearity of cographs (Q393888):
Displaying 5 items.
- Linearity is strictly more powerful than contiguity for encoding graphs (Q284761) (← links)
- The micro-world of cographs (Q831855) (← links)
- Tightness in subset bounds for coherent configurations (Q2454083) (← links)
- Linearity Is Strictly More Powerful Than Contiguity for Encoding Graphs (Q3449818) (← links)
- The Micro-world of Cographs (Q5041177) (← links)