Unit distance graphs with ambiguous chromatic number.
The Electronic Journal of Combinatorics [electronic only] (2009)
- Volume: 16, Issue: 1, page Research Paper N31, 7 p.-Research Paper N31, 7 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topPayne, Michael S.. "Unit distance graphs with ambiguous chromatic number.." The Electronic Journal of Combinatorics [electronic only] 16.1 (2009): Research Paper N31, 7 p.-Research Paper N31, 7 p.. <http://eudml.org/doc/228865>.
@article{Payne2009,
author = {Payne, Michael S.},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {Chromatic Number of the Plane problem; infinite graphs; ambiguous chromatic number; unit distance graphs},
language = {eng},
number = {1},
pages = {Research Paper N31, 7 p.-Research Paper N31, 7 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Unit distance graphs with ambiguous chromatic number.},
url = {http://eudml.org/doc/228865},
volume = {16},
year = {2009},
}
TY - JOUR
AU - Payne, Michael S.
TI - Unit distance graphs with ambiguous chromatic number.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2009
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 16
IS - 1
SP - Research Paper N31, 7 p.
EP - Research Paper N31, 7 p.
LA - eng
KW - Chromatic Number of the Plane problem; infinite graphs; ambiguous chromatic number; unit distance graphs
UR - http://eudml.org/doc/228865
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.