The following pages link to The four-colour theorem (Q1369648):
Displaying 50 items.
- Bicircular matroids are 3-colorable (Q271597) (← links)
- Three-edge-colouring doublecross cubic graphs (Q273169) (← links)
- On purely tree-colorable planar graphs (Q280945) (← links)
- Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle. (Q290801) (← links)
- On a Heawood-type problem for maps with tangencies (Q291171) (← links)
- Uniquely forced perfect matching and unique 3-edge-coloring (Q323081) (← links)
- Coloring immersion-free graphs (Q326817) (← links)
- Computing clique and chromatic number of circular-perfect graphs in polynomial time (Q378133) (← links)
- On \(r\)-hued coloring of \(K_4\)-minor free graphs (Q393165) (← links)
- The complexity of changing colourings with bounded maximum degree (Q407523) (← links)
- On dynamic coloring for planar graphs and graphs of higher genus (Q423914) (← links)
- Facial parity edge colouring of plane pseudographs (Q442406) (← links)
- From the plane to higher surfaces (Q444375) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- Book review of: Alexander Soifer, The mathematical coloring book. Mathematics of coloring and the colorful life of its creators (Q485101) (← links)
- Edge-colouring seven-regular planar graphs (Q491000) (← links)
- Edge-colouring eight-regular planar graphs (Q491001) (← links)
- Coloring clique-hypergraphs of graphs with no subdivision of \(K_5\) (Q500982) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- The \(a\)-graph coloring problem (Q516830) (← links)
- Injective colorings of graphs with low average degree (Q548659) (← links)
- On degrees in random triangulations of point sets (Q549246) (← links)
- Simpler multicoloring of triangle-free hexagonal graphs (Q658035) (← links)
- Cyclic colorings of plane graphs with independent faces (Q661937) (← links)
- Rotation sequences and edge-colouring of binary tree pairs (Q703564) (← links)
- Contractibility and the Hadwiger conjecture (Q710728) (← links)
- Five-coloring graphs on the Klein bottle (Q713974) (← links)
- Automated generation of conjectures on forbidden subgraph characterization (Q741737) (← links)
- A bound on the chromatic number of an almost planar graph (Q744556) (← links)
- Clique minors in claw-free graphs (Q765191) (← links)
- A proof via finite elements for Schiffer's conjecture on a regular pentagon (Q827006) (← links)
- Fullerene graphs have exponentially many perfect matchings (Q839387) (← links)
- On the connectivity of minimum and minimal counterexamples to Hadwiger's conjecture (Q858685) (← links)
- Contractions, cycle double covers, and cyclic colorings in locally connected graphs (Q859615) (← links)
- Coloring octrees (Q860807) (← links)
- Approximate min-max relations for odd cycles in planar graphs (Q877199) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- Distance constraints in graph color extensions (Q885289) (← links)
- A relaxed Hadwiger's conjecture for list colorings (Q885300) (← links)
- Computer-aided proof of Erdős discrepancy properties (Q892235) (← links)
- Light graphs in planar graphs of large girth (Q907844) (← links)
- Some remarks on the odd Hadwiger's conjecture (Q950324) (← links)
- Locally planar graphs are 5-choosable (Q958683) (← links)
- Facial colorings using Hall's theorem (Q966152) (← links)
- Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weight (Q973139) (← links)
- A simple algorithm for 4-coloring 3-colorable planar graphs (Q974757) (← links)
- A revision of the proof of the Kepler conjecture (Q977177) (← links)
- A bound on the treewidth of planar even-hole-free graphs (Q987668) (← links)
- Nowhere-zero 4-flow in almost Petersen-minor free graphs (Q1011772) (← links)
- The edge version of Hadwiger's conjecture (Q1011784) (← links)
