Tearing a strip off the plane
From MaRDI portal
Publication:4242925
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199809)29:1<17::AID-JGT3>3.0.CO;2-H" /><17::AID-JGT3>3.0.CO;2-H 10.1002/(SICI)1097-0118(199809)29:1<17::AID-JGT3>3.0.CO;2-HzbMath0919.05018OpenAlexW4233975827MaRDI QIDQ4242925
Publication date: 11 May 1999
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199809)29:1<17::aid-jgt3>3.0.co;2-h
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12)
Related Items (4)
On the chromatic number of an infinitesimal plane layer ⋮ Coloring distance graphs on the plane ⋮ On the chromatic number of subsets of the Euclidean plane ⋮ The chromatic number of the plane: the bounded case
This page was built for publication: Tearing a strip off the plane
