David Flores‐Peñaloza, Francisco Javier Zaragoza Martínez
Abstract
We prove that a graph is 4-colorable if and only if it can be drawn with vertices in the integer lattice, using as edges only line segments not containing a third point of the lattice. 1
OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We prove that a graph is 4-colorable if and only if it can be drawn with vertices in the integer lattice, using as edges only line segments not containing a third point of the lattice. 1
Key concepts: Combinatorics, Integer lattice, Mathematics, Wheel graph, Graph factorization, Graph, Lattice (music), Discrete mathematics