The following pages link to Three ways to cover a graph (Q898135):
Displaying 17 items.
- On the bend-number of planar and outerplanar graphs (Q477341) (← links)
- Boolean dimension and local dimension (Q1690054) (← links)
- Local and union boxicity (Q1709530) (← links)
- On the planar split thickness of graphs (Q1742373) (← links)
- On difference graphs and the local dimension of posets (Q1987070) (← links)
- Local boxicity (Q2122684) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Linear layouts of complete graphs (Q2151449) (← links)
- Local and union page numbers (Q2206876) (← links)
- The interval number of a planar graph is at most three (Q2221918) (← links)
- Edge-intersection graphs of grid paths: the bend-number (Q2440108) (← links)
- Local boxicity and maximum degree (Q2675846) (← links)
- On Covering Numbers, Young Diagrams, and the Local Dimension of Posets (Q4990391) (← links)
- The Local Queue Number of Graphs with Bounded Treewidth (Q5014102) (← links)
- Fast Diameter Computation within Split Graphs (Q5024674) (← links)
- Nordhaus-gaddum type inequalities for tree covering numbers on unitary cayley graphs of finite rings (Q5103954) (← links)
- On interval representations of graphs (Q5962513) (← links)
