The following pages link to A proof of the four color theorem (Q1230791):
Displaying 13 items.
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- The thickness and chromatic number of \(r\)-inflated graphs (Q709322) (← links)
- Approximate min-max relations for odd cycles in planar graphs (Q877199) (← links)
- Integer plane multiflow maximisation: one-quarter-approximation and gaps (Q2089777) (← links)
- Self-similar singularity of a 1D model for the 3D axisymmetric Euler equations (Q2347890) (← links)
- On maximum planar induced subgraphs (Q2500525) (← links)
- (Q3384162) (← links)
- Improper Colourings of Unit Disk Graphs (Q3439320) (← links)
- Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation (Q5041741) (← links)
- LOCAL CONSTRUCTION AND COLORING OF SPANNERS OF LOCATION AWARE UNIT DISK GRAPHS (Q5189993) (← links)
- The crisis in finite mathematics: Automated reasoning as cause and cure (Q5210758) (← links)
- Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs (Q5302070) (← links)
- Reasoning and proof in the mathematics classroom (Q5448096) (← links)
