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

A structural theorem on embedded graphs and its application to colorings

โœ Scribed by Bao Gang Xu; Xiao Xu Lu

Publisher
Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
2008
Tongue
English
Weight
160 KB
Volume
25
Category
Article
ISSN
1439-7617

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Structural theorem on plane graphs with
Structural theorem on plane graphs with application to the entire coloring number
โœ Borodin, Oleg V. ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 477 KB ๐Ÿ‘ 1 views

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

Structural properties of plane graphs wi
Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
โœ O. V. Borodin ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 190 KB ๐Ÿ‘ 1 views

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

The strength of a graph and its applicat
The strength of a graph and its application to organizational structure
โœ Michael F. Capobianco; John C. Molluzzo ๐Ÿ“‚ Article ๐Ÿ“… 1979 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 500 KB

The strength of a point in a graph is defined as the increase in the number of connected components in the graph upon removal of the point. Given an ordering of the points of a graph, the strength vector S of the graph is the vector whose ith component is the strength of the ith point of the graph.