In 1973, Kronk and Mitchem (Discrete Math. (5) 255-260) conjectured that the vertices, edges and faces of each plane graph G may be colored with D(G) + 4 colors, where D(G) is the maximum degree of G, so that any two adjacent or incident elements receive distinct colors. They succeeded in verifying
On Structure of Some Plane Graphs with Application to Choosability
β Scribed by Peter Che Bor Lam; Wai Chee Shiu; Baogang Xu
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 180 KB
- Volume
- 82
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
β¦ Synopsis
A graph G=(V, E) is (x, y)-choosable for integers x> y 1 if for any given family
In this paper, structures of some plane graphs, including plane graphs with minimum degree 4, are studied. Using these results, we may show that if G is free of k-cycles for some k # [3,4,5,6], or if any two triangles in G have distance at least 2, then G is (4m, m)-choosable for all nonnegative integers m. When m=1, (4m, m)-choosable is simply 4-choosable. So these conditions are also sufficient for a plane graph to be 4-choosable.
π SIMILAR VOLUMES
If in a plane graph with minimum degree 2 3 no t w o triangles have an edge in common, then: (1 there are two adjacent vertices with degree sum at most 9, and (2) there is a face of size between 4 and 9 or a 10-face incident with ten 3-vertices. It follows that every planar graph without cycles betw
A specific force field of Consistent Valence Force Field type was developed with the aim to simulate the structures of catalysts of vanadium phosphorus oxide type and the reversible adsorption of organic compounds on specific crystallographic planes of such catalysts by molecular modeling. The appro