The following pages link to The four-colour theorem (Q1369648):
Displaying 50 items.
- A survey on the cyclic coloring and its relaxations (Q2214302) (← links)
- On the 4-color theorem for signed graphs (Q2225420) (← links)
- Linear algebraic approach to an edge-coloring result (Q2251134) (← links)
- Five-list-coloring graphs on surfaces. I. Two lists of size two in planar graphs (Q2259863) (← links)
- Facial rainbow coloring of plane graphs (Q2312068) (← links)
- Kempe-locking configurations (Q2337272) (← links)
- Unique-maximum edge-colouring of plane graphs with respect to faces (Q2341735) (← links)
- Towards an algorithmic guide to Spiral Galaxies (Q2347000) (← links)
- Wolfgang Haken and the four-color problem (Q2358269) (← links)
- Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs (Q2359983) (← links)
- On computer-assisted proving the existence of periodic and bounded orbits (Q2363617) (← links)
- Homomorphism bounded classes of graphs (Q2368718) (← links)
- The \(d\)-precoloring problem for \(k\)-degenerate graphs (Q2370443) (← links)
- Transfer matrices and partition-function zeros for antiferromagnetic Potts models. V. Further results for the square-lattice chromatic polynomial (Q2391044) (← links)
- Cyclically five-connected cubic graphs (Q2396896) (← links)
- Facially-constrained colorings of plane graphs: a survey (Q2401805) (← links)
- Experimental mathematics, computers and the a priori (Q2441736) (← links)
- Polynomial hierarchy graph properties in hybrid logic (Q2453580) (← links)
- Spanning cycles in regular matroids without \(M^{*}(K_{5})\) minors (Q2462341) (← links)
- Fractional coloring and the odd Hadwiger's conjecture (Q2472835) (← links)
- Conditional colorings of graphs (Q2501581) (← links)
- Transition polynomials (Q2575798) (← links)
- Cyclic coloring of plane graphs with maximum face size 16 and 17 (Q2662786) (← links)
- Dual circumference and collinear sets (Q2679595) (← links)
- Epistemic injustice in mathematics (Q2690220) (← links)
- A note on the four color theorem (Q2697659) (← links)
- Breaking the degeneracy barrier for coloring graphs with no \(K_t\) minor (Q2700634) (← links)
- Chromatic numbers of quadrangulations on closed surfaces (Q2744570) (← links)
- Spanning embeddings of arrangeable graphs with sublinear bandwidth (Q2795744) (← links)
- Third case of the cyclic coloring conjecture (Q2797092) (← links)
- Large Independent Sets in Subquartic Planar Graphs (Q2803824) (← links)
- Coloring planar graphs via colored paths in the associahedra (Q2854965) (← links)
- An approximate restatement of the Four-Color Theorem (Q2856478) (← links)
- Randomized Δ-edge colouring via exchanges of complex colours (Q2868167) (← links)
- There Is No 16-Clue Sudoku: Solving the Sudoku Minimum Number of Clues Problem via Hitting Set Enumeration (Q2875538) (← links)
- Formalizing Frankl’s Conjecture: FC-Families (Q2907327) (← links)
- 3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle (Q2946045) (← links)
- Checking Proofs (Q2950035) (← links)
- RECONSTRUCTING CONVEX POLYGONS AND CONVEX POLYHEDRA FROM EDGE AND FACE COUNTS IN ORTHOGONAL PROJECTIONS (Q2999095) (← links)
- Coloring plane graphs with independent crossings (Q3055915) (← links)
- PARTIAL RESULT ON HADWIGER'S CONJECTURE (Q3063611) (← links)
- An unavoidable set of $D$-reducible configurations (Q3065754) (← links)
- The number of defective colorings of graphs on surfaces (Q3174242) (← links)
- Cyclic 4-Colorings of Graphs on Surfaces (Q3188662) (← links)
- On Tutte’s chromatic invariant (Q3402210) (← links)
- Even-hole-free planar graphs have bounded treewidth (Q3503541) (← links)
- The Four Colour Theorem: Engineering of a Formal Proof (Q3598006) (← links)
- The Maximum Independent Set Problem in Planar Graphs (Q3599118) (← links)
- Colouring Random Empire Trees (Q3599154) (← links)
- A Weakening of the Odd Hadwiger's Conjecture (Q3608337) (← links)
