The following pages link to Benjamin Reiniger (Q251903):
Displaying 13 items.
- Coloring, sparseness and girth (Q312271) (← links)
- New results on degree sequences of uniform hypergraphs (Q396927) (← links)
- A note on list-coloring powers of graphs (Q400353) (← links)
- Dynamic coloring parameters for graphs with given genus (Q1682887) (← links)
- The saturation number of induced subposets of the Boolean lattice (Q2012537) (← links)
- A simple characterization of proportionally 2-choosable graphs (Q2175799) (← links)
- The minimum number of edges in a 4-critical graph that is bipartite plus 3 edges (Q2255804) (← links)
- Proportional choosability: a new list analogue of equitable coloring (Q2319722) (← links)
- The game of overprescribed Cops and Robbers played on graphs (Q2409518) (← links)
- Perfect matchings and Hamiltonian cycles in the preferential attachment model (Q4633318) (← links)
- A symplectic proof of a theorem of Franks (Q4911993) (← links)
- The Game Saturation Number of a Graph (Q5272930) (← links)
- Large subposets with small dimension. (Q5965144) (← links)
