Square Coloring Planar Graphs with Automatic Discharging
From MaRDI portal
Publication:6141869
DOI10.1137/22m1492623zbMath1528.05020arXiv2204.05791WikidataQ129919578 ScholiaQ129919578MaRDI QIDQ6141869
Nicolas Bousquet, Lucas de Meyer, Théo Pierron, Quentin Deschamps
Publication date: 23 January 2024
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2204.05791
Linear programming (90C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Steinberg's conjecture is false
- Generation and properties of snarks
- An introduction to the discharging method via graph coloring
- Robbins algebras are Boolean: A revision of McCune's computer-generated solution of Robbins problem
- Wegner's conjecture on 2-distance coloring
- A unified approach to distance-two colouring of graphs on surfaces
- Painting squares in \(\Delta^2-1\) shades
- Cyclic coloring of plane graphs with maximum face size 16 and 17
- Improved square coloring of planar graphs
- Third Case of the Cyclic Coloring Conjecture
- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
- There Is No 16-Clue Sudoku: Solving the Sudoku Minimum Number of Clues Problem via Hitting Set Enumeration
- Choosability of the square of a planar graph with maximum degree four
- Flag Algebras: A First Glance
- The Non-Existence of Finite Projective Planes of Order 10
- List Colouring Squares of Planar Graphs
- Computer solution to the 17-point Erdős-Szekeres problem
- Minimum-weight triangulation is NP-hard
- A computer-assisted proof of the Feigenbaum conjectures
- Every planar map is four colorable
- The Generation of Fullerenes
- The resolution of Keller's conjecture
- Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable
