Pages that link to "Item:Q1250223"
From MaRDI portal
The following pages link to Every planar map is four colorable. I: Discharging (Q1250223):
Displaying 50 items.
- Regular independent sets (Q260019) (← links)
- Three-edge-colouring doublecross cubic graphs (Q273169) (← links)
- Generators and normal forms of Richard Thompson's group \(F\) and the four-color theorem (Q289030) (← links)
- Outer 1-planar graphs (Q289919) (← 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)
- I,F-partitions of sparse graphs (Q298327) (← links)
- Planar graphs have independence ratio at least 3/13 (Q311579) (← links)
- Third case of the cyclic coloring conjecture (Q322178) (← links)
- Coloring immersion-free graphs (Q326817) (← links)
- Optimal-depth sorting networks (Q340576) (← links)
- 5-list-coloring planar graphs with distant precolored vertices (Q345086) (← links)
- Solution of the propeller conjecture in \(\mathbb R^3\) (Q368772) (← links)
- On \(r\)-hued coloring of \(K_4\)-minor free graphs (Q393165) (← links)
- Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable (Q393358) (← links)
- Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable (Q393460) (← links)
- Challenges to the assessment of time-to-proof of mathematical conjectures (Q393479) (← links)
- On 1-improper 2-coloring of sparse graphs (Q393935) (← links)
- Toward a language theoretic proof of the four color theorem (Q408127) (← links)
- \((k,1)\)-coloring of sparse graphs (Q409448) (← links)
- \((k,j)\)-coloring of sparse graphs (Q411834) (← links)
- On dynamic coloring for planar graphs and graphs of higher genus (Q423914) (← links)
- Computer-assisted proof of performance ratios for the differencing method (Q435724) (← links)
- Euler index in uncertain graph (Q449488) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- Is the five-flow conjecture almost false? (Q463296) (← links)
- Strong chromatic index of planar graphs with large girth (Q472129) (← links)
- A note on vertex colorings of plane graphs (Q472144) (← links)
- Zero-sum flows of the linear lattice. (Q473085) (← links)
- On the tractability of some natural packing, covering and partitioning problems (Q476298) (← links)
- Can strategizing in round-robin subtournaments be avoided? (Q483532) (← links)
- Infinite-dimensional integration in weighted Hilbert spaces: anchored decompositions, optimal deterministic algorithms, and higher-order convergence (Q486680) (← links)
- Planar graphs with girth at least 5 are \((3, 5)\)-colorable (Q488297) (← links)
- Edge-colouring seven-regular planar graphs (Q491000) (← links)
- Edge-colouring eight-regular planar graphs (Q491001) (← links)
- Hadwiger's conjecture for inflations of 3-chromatic graphs (Q499451) (← links)
- An introduction to mechanized reasoning (Q504394) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles (Q511730) (← links)
- The \(a\)-graph coloring problem (Q516830) (← links)
- Binary pattern tile set synthesis is NP-hard (Q527409) (← links)
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- Extending planar graph algorithms to \(K_{3,3}\)-free graphs (Q582121) (← links)
- Automated theorem provers: a practical tool for the working mathematician? (Q657585) (← links)
- Vertex decompositions of sparse graphs into an independent vertex set and a subgraph of maximum degree at most 1 (Q665888) (← links)
- Tree-like distance colouring for planar graphs of sufficient girth (Q668079) (← links)
- Guthrie's problem: new equivalences and rapid reductions (Q672855) (← links)
- Guarding polyhedral terrains (Q676572) (← links)
- Edge guarding polyhedral terrains (Q676574) (← links)
- Thickness and colorability of geometric graphs (Q679741) (← links)
