𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Large faces in 4-critical planar graphs with minimum degree 4

✍ Scribed by H. L. Abbott; D. R. Hare; B. Zhou

Book ID
105111807
Publisher
Springer-Verlag
Year
1995
Tongue
English
Weight
474 KB
Volume
15
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Light subgraphs in planar graphs of mini
Light subgraphs in planar graphs of minimum degree 4 and edge-degree 9
✍ B. Mohar; R. Ε krekovski; H.-J. Voss πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 326 KB πŸ‘ 1 views

## Abstract A graph __H__ is light in a given class of graphs if there is a constant __w__ such that every graph of the class which has a subgraph isomorphic to __H__ also has a subgraph isomorphic to __H__ whose sum of degrees in __G__ is ≀ __w__. Let $\cal G$ be the class of simple planar graphs

Cycle lengths in graphs with large minim
Cycle lengths in graphs with large minimum degree
✍ V. Nikiforov; R. H. Schelp πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 114 KB πŸ‘ 1 views

## Abstract Our main result is the following theorem. Let __k__ β‰₯ 2 be an integer, __G__ be a graph of sufficiently large order __n__, and __Ξ΄__(__G__) β‰₯ __n__/__k__. Then: __G__ contains a cycle of length __t__ for every even integer __t__β€‰βˆˆβ€‰[4, __Ξ΄__(__G__) + 1]. If __G__ is nonbipartite then

On 4-critical planar graphs with high ed
On 4-critical planar graphs with high edge density
✍ Gerhard Koester πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 236 KB

Koester, G., On 4-critical planar graphs with high edge density, Discrete Mathematics 98 (1991) 147-151.