The following pages link to Raphael Steiner (Q779241):
Displaying 48 items.
- Parameterized algorithms for directed modular width (Q779243) (← links)
- Equiangular polygon contact representations (Q1627169) (← links)
- A note on coloring digraphs of large girth (Q2004076) (← links)
- The star dichromatic number (Q2062686) (← links)
- Coloring drawings of graphs (Q2073312) (← links)
- Colouring non-even digraphs (Q2094875) (← links)
- Matching theory and Barnette's conjecture (Q2099486) (← links)
- Colorings of oriented planar graphs avoiding a monochromatic subgraph (Q2166215) (← links)
- Complete acyclic colorings (Q2185231) (← links)
- A note on universal point sets for planar graphs (Q2206869) (← links)
- Topological Drawings Meet Classical Theorems from Convex Geometry (Q5014123) (← links)
- Even circuits in oriented matroids (Q5052170) (← links)
- A Note on Universal Point Sets for Planar Graphs (Q5119378) (← links)
- On the Complexity of Digraph Colourings and Vertex Arboricity (Q5130735) (← links)
- On the average complexity of the $k$-level (Q5132651) (← links)
- Pentagon contact representations (Q5915723) (← links)
- Flip distances between graph orientations (Q5919075) (← links)
- Flip distances between graph orientations (Q5919466) (← links)
- Topological drawings meet classical theorems from convex geometry (Q6074002) (← links)
- Strengthening Hadwiger's conjecture for 4- and 5-chromatic graphs (Q6144390) (← links)
- Hat Guessing Numbers of Strongly Degenerate Graphs (Q6161264) (← links)
- Tight bounds for divisible subdivisions (Q6187340) (← links)
- On an induced version of Menger's theorem (Q6451194) (← links)
- Hadwiger's conjecture and topological bounds (Q6515408) (← links)
- Resolution of the Kohayakawa-Kreuter conjecture (Q6520384) (← links)
- Edge partitions of complete geometric graphs (Q6539523) (← links)
- Chromatic number is not tournament-local (Q6564606) (← links)
- Coloring hypergraphs with excluded minors (Q6568846) (← links)
- Exact matching in graphs of bounded independence number (Q6584045) (← links)
- On connectivity in random graph models with limited dependencies (Q6596388) (← links)
- Coloring circle arrangements: new 4-chromatic planar graphs (Q6604677) (← links)
- Hadwiger's conjecture and topological bounds (Q6612303) (← links)
- Coloring circle arrangements: new 4-chromatic planar graphs (Q6612515) (← links)
- A logarithmic bound for simultaneous embeddings of planar graphs (Q6618255) (← links)
- Linear size universal point sets for classes of planar graphs (Q6620521) (← links)
- Colouring non-even digraphs (Q6621244) (← links)
- On the choosability of \(H\)-minor-free graphs (Q6632798) (← links)
- On an induced version of Menger's theorem (Q6635183) (← links)
- Finding dense minors using average degree (Q6642522) (← links)
- On connectivity in random graph models with limited dependencies (Q6663045) (← links)
- Optimal bounds for zero-sum cycles. I. Odd order (Q6734403) (← links)
- Improved bounds for zero-sum cycles in $\mathbb{Z}_p^d$ (Q6735992) (← links)
- Topological Minors in Typical Lifts (Q6736551) (← links)
- On the difference between the chromatic and cochromatic number (Q6739330) (← links)
- Longest cycles in vertex-transitive and highly connected graphs (Q6739833) (← links)
- Chromatic number and regular subgraphs (Q6747334) (← links)
- Fractional chromatic number vs. Hall ratio (Q6755004) (← links)
- Local Shearer bound (Q6760603) (← links)
