The following pages link to Veit Wiechert (Q521396):
Displaying 17 items.
- On the queue-number of graphs with bounded tree-width (Q521397) (← links)
- An on-line competitive algorithm for coloring bipartite graphs without long induced paths (Q524365) (← links)
- Boxicity, poset dimension, and excluded minors (Q668021) (← links)
- Grid intersection graphs and order dimension (Q722596) (← links)
- Sparsity and dimension (Q1715074) (← links)
- Nowhere dense graph classes and dimension (Q2288358) (← links)
- The dimension of posets with planar cover graphs. (Q2354607) (← links)
- On the dimension of posets with cover graphs of treewidth 2 (Q2407679) (← links)
- A note on concurrent graph sharing games (Q2830435) (← links)
- An On-line Competitive Algorithm for Coloring $$P_8$$-free Bipartite Graphs (Q2942656) (← links)
- Sparsity and dimension (Q4575709) (← links)
- Topological Minors of Cover Graphs and Dimension (Q4596316) (← links)
- Planar Posets Have Dimension at Most Linear in Their Height (Q4599767) (← links)
- A minimum-change version of the Chung-Feller theorem for Dyck paths (Q5915781) (← links)
- Burling graphs, chromatic number, and orthogonal tree-decompositions (Q5915813) (← links)
- A minimum-change version of the Chung-Feller theorem for Dyck paths (Q5970257) (← links)
- Burling graphs, chromatic number, and orthogonal tree-decompositions (Q5970276) (← links)
