CCCG 2009, Vancouver, BC, August 17–19, 2009 Every four-colorable graph is isomorphic to a subgraph of the Visibility Graph of the Integer Lattice David Flores-Peñaloza∗ - Graph structure theorem - Document - PDFSEARCH.IO

First Page	Meta Content
	CCCG 2009, Vancouver, BC, August 17–19, 2009 Every four-colorable graph is isomorphic to a subgraph of the Visibility Graph of the Integer Lattice David Flores-Peñaloza∗ Add to Reading List Document Date: 2009-09-02 14:32:22 Open Document File Size: 301,71 KB Share Result on Facebook City Philadelphia / Mexico City / Vancouver / / Country Mexico / United States / / Currency pence / / / Organization Universidad Autónoma Metropolitana Azcapotzalco / Universidad Nacional Autónoma / Society for Industrial and Applied Mathematics / Universidad Autónoma Metropolitana Unidad Azcapotzalco / / Person Attila Pór / Walter Schnyder / Jan Kára / David R. Wood / Marek Chrobak / / / ProvinceOrState British Columbia / / SocialTag Planar graphs Graph Lattice Four color theorem Uniquely colorable graph Graph structure theorem Graph theory Mathematics Graph coloring

CCCG 2009, Vancouver, BC, August 17–19, 2009 Every four-colorable graph is isomorphic to a subgraph of the Visibility Graph of the Integer Lattice David Flores-Peñaloza∗Add to Reading List