Pages that link to "Item:Q3993359"
From MaRDI portal
The following pages link to Every Planar Map is Four Colorable (Q3993359):
Displaying 50 items.
- 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)
- Challenges to the assessment of time-to-proof of mathematical conjectures (Q393479) (← links)
- Computer-assisted proof of performance ratios for the differencing method (Q435724) (← links)
- From the plane to higher surfaces (Q444375) (← links)
- Zero-sum flows of the linear lattice. (Q473085) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- Separating sets of strings by finding matching patterns is almost always hard (Q507598) (← links)
- Complexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surface (Q602768) (← links)
- Parity vertex colouring of plane graphs (Q626871) (← links)
- Looseness of plane graphs (Q659673) (← links)
- Five-coloring graphs on the Klein bottle (Q713974) (← links)
- A bound on the chromatic number of an almost planar graph (Q744556) (← links)
- A proof via finite elements for Schiffer's conjecture on a regular pentagon (Q827006) (← links)
- Light graphs in planar graphs of large girth (Q907844) (← links)
- Finding the exact bound of the maximum degrees of class two graphs embeddable in a surface of characteristic \(\epsilon \in \{-1, -2, -3\}\) (Q933675) (← links)
- Organizing volumes of right-angled hyperbolic polyhedra (Q945671) (← links)
- Locally planar graphs are 5-choosable (Q958683) (← links)
- Nowhere-zero 4-flow in almost Petersen-minor free graphs (Q1011772) (← links)
- Volume estimates for equiangular hyperbolic Coxeter polyhedra (Q1022516) (← links)
- Vivid: a framework for heterogeneous problem solving (Q1045993) (← links)
- On cyclic colorings and their generalizations (Q1301650) (← links)
- A self-stabilizing algorithm for coloring planar graphs (Q1310570) (← links)
- The four-colour theorem (Q1369648) (← links)
- Lie algebras and the four color theorem (Q1375054) (← links)
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures (Q1422414) (← links)
- Edge colorings of graphs embeddable in a surface of low genus (Q1584389) (← links)
- Facial incidence colorings of embedded multigraphs (Q1630925) (← links)
- A note on not-4-list colorable planar graphs (Q1640221) (← links)
- Construction of fullerenes and Pogorelov polytopes with 5-, 6- and one 7-gonal face (Q1657010) (← links)
- Improved bounds for guarding plane graphs with edges (Q1741583) (← links)
- The extremal function and Colin de Verdière graph parameter (Q1753124) (← links)
- Network pollution games (Q1755784) (← links)
- Tait colorings, and an instanton homology for webs and foams (Q1757298) (← links)
- Cyclic, diagonal and facial colorings (Q1767632) (← links)
- Choosability, edge choosability and total choosability of outerplane graphs (Q1840829) (← links)
- Surfaces, tree-width, clique-minors, and partitions (Q1850479) (← 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)
- Coverage with \(k\)-transmitters in the presence of obstacles (Q1944388) (← links)
- A deformation of instanton homology for webs (Q2001906) (← links)
- Maximal distance spectral radius of 4-chromatic planar graphs (Q2020654) (← links)
- Simple graphs of order 12 and minimum degree 6 contain \(K_6\) minors (Q2036707) (← links)
- Political districting to minimize cut edges (Q2099493) (← links)
- Say no to case analysis: automating the drudgery of case-based proofs (Q2117657) (← links)
- Computer-assisted estimates for Birkhoff normal forms (Q2194431) (← links)
- Foam evaluation and Kronheimer-Mrowka theories (Q2214075) (← links)
- Linear algebraic approach to an edge-coloring result (Q2251134) (← links)
- Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs (Q2359983) (← links)
- Transfer matrices and partition-function zeros for antiferromagnetic Potts models. V. Further results for the square-lattice chromatic polynomial (Q2391044) (← links)
