The following pages link to Raphael Steiner (Q779241):
Displaying 22 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)
