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.
Let denote the set of all maximal planar graphs with exactly n—1 vertices of degree five and one of degree n—7. In this article we prove and extend a conjecture stated by R. H. Fox: i.e. that for the set is empty.
Download Results (CSV)