The following pages link to The four-colour theorem (Q1369648):
Displaying 50 items.
- Linear connectivity forces large complete bipartite minors (Q1026000) (← links)
- Note on coloring graphs without odd-\(K_k\)-minors (Q1026013) (← links)
- List-coloring graphs without \(K_{4,k}\)-minors (Q1028458) (← links)
- The Voronoi diagram of three lines (Q1028584) (← links)
- Cliques, minors and apex graphs (Q1043579) (← links)
- The four color proof suffices (Q1066155) (← links)
- Bicubic planar maps (Q1296161) (← links)
- On cyclic colorings and their generalizations (Q1301650) (← links)
- On intersection representations of co-planar graphs (Q1377831) (← links)
- Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces (Q1410592) (← links)
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures (Q1422414) (← links)
- Edge-disjoint odd cycles in planar graphs. (Q1425111) (← links)
- Fractional colouring and Hadwiger's conjecture (Q1569032) (← links)
- Edge colorings of graphs embeddable in a surface of low genus (Q1584389) (← links)
- Facial incidence colorings of embedded multigraphs (Q1630925) (← links)
- 3-coloring triangle-free planar graphs with a precolored 9-cycle (Q1678087) (← links)
- Arc diagrams, flip distances, and Hamiltonian triangulations (Q1699291) (← links)
- The set of vertices with positive curvature in a planar graph with nonnegative curvature (Q1711929) (← links)
- Graph edge coloring: a survey (Q1733850) (← links)
- The extremal function and Colin de Verdière graph parameter (Q1753124) (← links)
- On the structure of \(k\)-connected graphs without \(K_{k}\)-minor (Q1767621) (← links)
- Cyclic, diagonal and facial colorings (Q1767632) (← links)
- Random planar graphs (Q1767669) (← links)
- Signed diagonal flips and the four color theorem (Q1817590) (← 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)
- Computers and discovery in algebraic graph theory (Q1855400) (← links)
- Extending precolorings of subgraphs of locally planar graphs (Q1883295) (← links)
- Coloring Eulerian triangulations of the Klein bottle (Q1926035) (← links)
- Polyhedron of triangle-free simple 2-matchings in subcubic graphs (Q1949271) (← links)
- Uncertain vertex coloring problem (Q2001167) (← links)
- Maximal distance spectral radius of 4-chromatic planar graphs (Q2020654) (← links)
- Spontaneous periodic orbits in the Navier-Stokes flow (Q2022571) (← links)
- A curvature notion for planar graphs stable under planar duality (Q2032918) (← links)
- Representing graphs as the intersection of cographs and threshold graphs (Q2040010) (← links)
- On \(r\)-hued list coloring of \(K_4 ( 7 )\)-minor free graphs (Q2065804) (← links)
- Global dynamics in nonconservative nonlinear Schrödinger equations (Q2078873) (← links)
- Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds (Q2093577) (← links)
- Immersion and clustered coloring (Q2099417) (← links)
- Tutte paths and long cycles in circuit graphs (Q2099420) (← links)
- Building a maximal independent set for the vertex-coloring problem on planar graphs (Q2133444) (← links)
- A heuristic for the coloring of planar graphs (Q2133446) (← links)
- Rotation invariant patterns for a nonlinear Laplace-Beltrami equation: a Taylor-Chebyshev series approach (Q2136229) (← links)
- Subcubic planar graphs of girth 7 are class I (Q2144599) (← links)
- Conflict-free coloring bounds on open neighborhoods (Q2161000) (← links)
- Graph coloring and semidefinite rank (Q2164723) (← links)
- The 2-factor polynomial detects even perfect matchings (Q2185217) (← links)
- Decomposition and \(r\)-hued coloring of \(K_4(7)\)-minor free graphs (Q2189858) (← links)
