"Every four-colorable graph is isomorphic to a subgraph of the Visibility ..."

David Flores-Peñaloza, Francisco Javier Zaragoza Martínez (2009)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2020-03-12

- view
  - electronic edition @ cccg.ca (open access)
- export record
  dblp key:
  - conf/cccg/Flores-PenalozaM09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cccg/Flores-PenalozaM09
David Flores-Peñaloza, Francisco Javier Zaragoza Martínez:
Every four-colorable graph is isomorphic to a subgraph of the Visibility Graph of the Integer Lattice. CCCG 2009: 91-94

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.