Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Back to Simple Search

Advanced Search

Match of the following rules

Add Another Rule

Contains the following math formula (red border means the formula is incomplete)

Formula preview

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Currently displaying 1 – 2 of 2

Order by Relevance | Title | Year of publication

On the chromatic number of intersection graphs of convex sets in the plane.

Kim, Seog-Jin; Kostochka, Alexandr; Nakprasit, Kittikorn — 2004

The Electronic Journal of Combinatorics [electronic only]

Triangle-free planar graphs with minimum degree 3 have radius at least 3

Seog-Jin Kim; Douglas B. West — 2008

Discussiones Mathematicae Graph Theory

We prove that every triangle-free planar graph with minimum degree 3 has radius at least 3; equivalently, no vertex neighborhood is a dominating set.

Page 1

Download Results (CSV)