<--- Back to Details
First PageDocument Content
Hadwiger–Nelson problem / Unit distance graph / Lattice / De Bruijn–Erdős theorem / Graph theory / Mathematics / Graph coloring
Date: 2006-05-25 22:24:06
Hadwiger–Nelson problem
Unit distance graph
Lattice
De Bruijn–Erdős theorem
Graph theory
Mathematics
Graph coloring

Add to Reading List

Source URL: sziami.cs.bme.hu

Download Document from Source Website

File Size: 76,73 KB

Share Document on Facebook

Similar Documents

Planar graphs / Geometric graph theory / Differential topology / Elementary geometry / Sphere / Topology / De Bruijn–Erdős theorem / Circle packing theorem / Geometry / Mathematics / Graph theory

On the size of the Euclidean sphere of in uence graph Michael A. Soss School of Computer Science McGill University Montreal, Canada May 14, 1999

DocID: 18rdH - View Document

Conic sections / Discrete geometry / Elementary geometry / Line / Plane / Ellipse / De Bruijn–Erdős theorem / Sylvester–Gallai theorem / Geometry / Euclidean plane geometry / Analytic geometry

CCCG 2011, Toronto ON, August 10–12, 2011 Collinearities in Kinetic Point Sets Ben D. Lund∗ George B. Purdy†

DocID: 17K52 - View Document

Conic sections / Discrete geometry / Elementary geometry / Line / Plane / Ellipse / De Bruijn–Erdős theorem / Sylvester–Gallai theorem / Geometry / Euclidean plane geometry / Analytic geometry

CCCG 2011, Toronto ON, August 10–12, 2011 Collinearities in Kinetic Point Sets Ben D. Lund∗ George B. Purdy†

DocID: 17AeG - View Document

Graph coloring / Flow network / Operations research / Graph / End / Connectivity / De Bruijn–Erdős theorem / Edge coloring / Graph theory / Mathematics / Network flow

Electric currents in infinite networks Peter G. Doyle Version dated 25 October 1988 GNU FDL∗ 1

DocID: LAbL - View Document

De Bruijn–Erdős theorem / Mathematics / Graph coloring / Edge coloring

PDF Document

DocID: muCF - View Document