Pages that link to "Item:Q4097312"
From MaRDI portal
The following pages link to Every planar map is four colorable (Q4097312):
Displaying 50 items.
- Bicircular matroids are 3-colorable (Q271597) (← links)
- The cost of perfection for matchings in graphs (Q299061) (← links)
- On backbone coloring of graphs (Q434190) (← links)
- Facial parity edge colouring of plane pseudographs (Q442406) (← links)
- On coloring box graphs (Q472968) (← links)
- WORM colorings of planar graphs (Q521753) (← links)
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- Entire colouring of plane graphs (Q651038) (← links)
- List 2-facial 5-colorability of plane graphs with girth at least 12 (Q658054) (← links)
- Cyclic colorings of plane graphs with independent faces (Q661937) (← links)
- Guthrie's problem: new equivalences and rapid reductions (Q672855) (← links)
- Rotation sequences and edge-colouring of binary tree pairs (Q703564) (← links)
- The thickness and chromatic number of \(r\)-inflated graphs (Q709322) (← links)
- Bounds and fixed-parameter algorithms for weighted improper coloring (Q737104) (← links)
- Chromatic numbers of simplicial manifolds (Q784756) (← links)
- An efficient parallel algorithm for computing a large independent set in a planar graph (Q808288) (← links)
- Hadwiger's conjecture for circular colorings of edge-weighted graphs (Q864127) (← links)
- Distance constraints in graph color extensions (Q885289) (← links)
- Computer-aided proof of Erdős discrepancy properties (Q892235) (← links)
- Facial entire colouring of plane graphs (Q898120) (← links)
- How reliable is a computer-based proof? (Q911568) (← links)
- Labelling planar graphs without 4-cycles with a condition on distance two (Q947103) (← links)
- Adjacent vertex distinguishing total colorings of outerplanar graphs (Q965812) (← links)
- The edge version of Hadwiger's conjecture (Q1011784) (← links)
- The edge-face coloring of graphs embedded in a surface of characteristic zero (Q1025544) (← links)
- deBruijn-like sequences and the irregular chromatic number of paths and cycles (Q1045102) (← links)
- Vector colorability (Q1100473) (← links)
- A note on half-planar geometries (Q1154472) (← links)
- Conjecture de Hadwiger: \(k=6\). II: Réductions de sommets de degré 6 dans les graphes 6-chromatiques contraction-critiques. (Hardwiger's conjecture: \(k=6\). II: Reductions of 6-vertices in 6-chromatic contraction-critical graphs) (Q1197029) (← links)
- A complete classification of tractability in Allen's algebra relative to subsets of basic relations (Q1277697) (← links)
- Antisymmetric flows and strong colourings of oriented graphs (Q1296157) (← links)
- Simultaneous coloring of edges and faces of plane graphs (Q1322167) (← links)
- Colorings and girth of oriented planar graphs (Q1356774) (← links)
- An implicit numerical scheme for the simulation of internal viscous flow on unstructured grids (Q1370694) (← links)
- On intersection representations of co-planar graphs (Q1377831) (← links)
- Maximum face-constrained coloring of plane graphs (Q1421525) (← links)
- Ising spins on thin graphs (Q1571403) (← links)
- Domination parameters of a graph and its complement (Q1692643) (← links)
- Induced 2-degenerate subgraphs of triangle-free planar graphs (Q1753031) (← links)
- Entire coloring of graphs embedded in a surface of nonnegative characteristic (Q1756114) (← links)
- An algebraic approach to the planar coloring problem (Q1803205) (← links)
- On local transformation of polygons with visibility properties. (Q1853571) (← links)
- Extending precolorings of subgraphs of locally planar graphs (Q1883295) (← links)
- A categorical setting for the 4-colour theorem (Q1901000) (← links)
- Supereulerian graphs and excluded induced minors (Q1903724) (← links)
- Coloring Eulerian triangulations of the Klein bottle (Q1926035) (← links)
- Ugly mathematics: why do mathematicians dislike computer-assisted proofs? (Q1935355) (← links)
- Uncertain vertex coloring problem (Q2001167) (← links)
- The existence of uniform hypergraphs for which the interpolation property of complete coloring fails (Q2065902) (← links)
- Strict neighbor-distinguishing total index of graphs (Q2131155) (← links)
