The following pages link to (Q4027193):
Displaying 10 items.
- Towards optimal embedding of an arbitrary tree in a graceful tree (Q324915) (← links)
- Optimal one-page tree embeddings in linear time (Q1014395) (← links)
- Edge and node searching problems on trees (Q1575444) (← links)
- Track layouts, layered path decompositions, and leveled planarity (Q1739109) (← links)
- Near-optimal lower bounds on regular resolution refutations of Tseitin formulas for all constant-degree graphs (Q1983330) (← links)
- The theory of guaranteed search on graphs (Q2439841) (← links)
- On Evasion Games on Graphs (Q2958109) (← links)
- Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs (Q3588402) (← links)
- Separating layered treewidth and row treewidth (Q6045398) (← links)
- Sparse universal graphs for planarity (Q6085077) (← links)