๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Properties of a planar cubic graph

โœ Scribed by Shunichi Toida

Publisher
Elsevier Science
Year
1973
Tongue
English
Weight
506 KB
Volume
295
Category
Article
ISSN
0016-0032

No coin nor oath required. For personal study only.

โœฆ Synopsis

It is shown that a planar can always be to planar graph fewer vertices. It is shown if a planar cubic graph is edge-3colorable then the reduction of the number of its vertices is possible without changing colors of its edges.

๐Ÿ“œ SIMILAR VOLUMES

The smallest 2-connected cubic bipartite
The smallest 2-connected cubic bipartite planar nonhamiltonian graph
โœ Takao Asano; Nobuji Saito; Geoffrey Exoo; Frank Harary ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 519 KB

## Butte producxd ihe first example of a 3-connected cubic planar nonhamihonian gJaph. On adding the cxmcition that the graph must he bipartite and admitting 2-connected graphs. We prove that the smallest possible such graph has 26 points and is unique.

The number of edge 3-colorings of a plan
The number of edge 3-colorings of a planar cubic graph as a permanent
โœ David E. Scheim ๐Ÿ“‚ Article ๐Ÿ“… 1974 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 370 KB

In this paper, we establish that the number of edge 3-colorings of a finite planar cubic graph G, i.e., 3-colorings of its interchange graph H, is equal to 2\*lPermanent(A)l, where N is the number of edges of G, and A is the 2N X 2iV square matrix formed by repeating each row of the N X 2N vertexdir