The following pages link to Daniel P. Sanders (Q202001):
Displayed 38 items.
- Three-edge-colouring doublecross cubic graphs (Q273169) (← links)
- On circuits through five edges (Q1126199) (← links)
- On 2-connected spanning subgraphs with low maximum degree (Q1127880) (← links)
- On simultaneous edge-face colorings of plane graphs (Q1272182) (← links)
- On cyclic colorings and their generalizations (Q1301650) (← links)
- Partitioning graphs of bounded tree-width (Q1307308) (← links)
- (Q1369647) (redirect page) (← links)
- The four-colour theorem (Q1369648) (← links)
- On \(d\)-diagonal colorings of embedded graphs of low maximum face size (Q1385301) (← links)
- On the size of edge chromatic critical graphs (Q1403929) (← links)
- Coloring edges of graphs embedded in a surface of characteristic zero. (Q1405117) (← links)
- A five-color theorem (Q1567630) (← links)
- On simultaneous colorings of embedded graphs (Q1586769) (← links)
- A note on the three color problem (Q1805376) (← links)
- Excluding any graph as a minor allows a low tree-width 2-coloring (Q1826951) (← links)
- Surfaces, tree-width, clique-minors, and partitions (Q1850479) (← links)
- A new bound on the cyclic chromatic number (Q1850557) (← links)
- Planar graphs of maximum degree seven are Class I (Q1850561) (← links)
- Coloring the faces of convex polyhedra so that like colors are far apart (Q1850618) (← links)
- On acyclic colorings of graphs on surfaces (Q1916898) (← links)
- (Q2707974) (← links)
- (Q3129827) (← links)
- (Q4228512) (← links)
- On total 9-coloring planar graphs of maximum degree seven (Q4242734) (← links)
- On Light Edges and Triangles in Planar Graphs of Minimum Degree Five (Q4321246) (← links)
- (Q4340879) (← links)
- On the Entire Coloring Conjecture (Q4487056) (← links)
- Coloring edges of embedded graphs (Q4521489) (← links)
- On the face touching number (Q4715280) (← links)
- On Diagonally 10‐Coloring Plane Triangulations (Q4843507) (← links)
- On Hamilton cycles in certain planar graphs (Q4862107) (← links)
- On Linear Recognition of Tree-Width at Most Four (Q4875439) (← links)
- (Q4875686) (← links)
- On light edges and triangles in projective planar graphs (Q4875689) (← links)
- Ond-diagonal colorings (Q4888108) (← links)
- On improving the edge-face coloring theorem (Q5943052) (← links)
- Reducibility in the Four-Color Theorem (Q6248456) (← links)
- Discharging cartwheels (Q6248458) (← links)