The following pages link to The four-colour theorem (Q1369648):
Displaying 43 items.
- (Q4340879) (← links)
- (Q4514229) (← links)
- Light structures in infinite planar graphs without the strong isoperimetric property (Q4529727) (← links)
- Hamilton weights and Petersen minors (Q4539867) (← links)
- Conflict-Free Coloring of Graphs (Q4556952) (← links)
- Introduction to rigorous numerics in dynamics: General functional analytic setup and an example that forces chaos (Q4557491) (← links)
- Hyperbolic families and coloring graphs on surfaces (Q4560169) (← links)
- Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs (Q4564884) (← links)
- (Q4873183) (← links)
- One More Probabilistic Reformulation of the Four Colour Conjecture (Q4911115) (← links)
- An Approximation Algorithm for Fully Planar Edge-Disjoint Paths (Q4986808) (← links)
- Graphs, friends and acquaintances (Q5009989) (← links)
- (Q5088959) (← links)
- Grünbaum colorings of toroidal triangulations (Q5189240) (← links)
- Large Independent Sets in Triangle-Free Planar Graphs (Q5270410) (← links)
- Six-Critical Graphs on the Klein Bottle (Q5301014) (← links)
- The justification of mathematical statements (Q5301857) (← links)
- Hadwiger's Conjecture for Graphs with Forbidden Holes (Q5348213) (← links)
- (Q5469947) (← links)
- Subcubic triangle-free graphs have fractional chromatic number at most 14/5 (Q5494396) (← links)
- (Q5528475) (← links)
- (Q5743487) (← links)
- Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles (Q5860479) (← links)
- Extremal functions for sparse minors (Q5871274) (← links)
- (Q5874489) (← links)
- Clustered 3-colouring graphs of bounded degree (Q5886311) (← links)
- Irreducible 4-critical triangle-free toroidal graphs (Q5915812) (← links)
- Dynamic programming approach to the generalized minimum Manhattan network problem (Q5918463) (← links)
- Some arithmetical restatements of the four color conjecture (Q5941259) (← links)
- Proper orientations and proper chromatic number (Q6038578) (← links)
- Coloring count cones of planar graphs (Q6057584) (← links)
- 4‐Separations in Hajós graphs (Q6057653) (← links)
- Packing Signatures in Signed Graphs (Q6057805) (← links)
- Transformation invariance in the combinatorial Nullstellensatz and nowhere-zero points of non-singular matrices (Q6091814) (← links)
- Approximating maximum integral multiflows on bounded genus graphs (Q6142346) (← links)
- Strengthening Hadwiger's conjecture for 4- and 5-chromatic graphs (Q6144390) (← links)
- Strengthening a Theorem of Meyniel (Q6158364) (← links)
- List 4-colouring of planar graphs (Q6170786) (← links)
- Refined List Version of Hadwiger’s Conjecture (Q6171265) (← links)
- Graph coloring and semidefinite rank (Q6589762) (← links)
- Rock extensions with linear diameters (Q6654117) (← links)
- Proper conflict-free coloring of sparse graphs (Q6657259) (← links)
- Zonal labelings and Tait colorings from a new perspective (Q6657293) (← links)
