𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Light subgraphs in the family of 1-planar graphs with high minimum degree

✍ Scribed by Xin Zhang, Gui Zhen Liu, Jian Liang Wu

Book ID
113057229
Publisher
Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
2011
Tongue
English
Weight
260 KB
Volume
28
Category
Article
ISSN
1439-7617

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

Subgraphs with restricted degrees of the
Subgraphs with restricted degrees of their vertices in planar graphs
✍ Igor Fabrici; Stanislav Jendrol' πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 335 KB

We prove that every 3-connected planar graph G of order at least k contains a connected subgraph H on k vertices each of which has degree (in G) at most 4k + 3, the bound 4k + 3 being best possible. (~

On Light Edges and Triangles in Planar G
On Light Edges and Triangles in Planar Graphs of Minimum Degree Five
✍ Oleg V. Borodin; Daniel P. Sanders πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 342 KB πŸ‘ 1 views

## Abstract This paper presents two tight inequalities for planar graphs of minimum degree five. An edge or face of a plane graph is light if the sum of the degrees of the vertices incident with it is small. A light edge inequality is presented which shows that planar graphs of minimum degree five

On the fixed edge of planar graphs with
On the fixed edge of planar graphs with minimum degree five
✍ Baogang Xu; Hongbing Fan πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 207 KB

An edge e of a finite and simple graph G is called a fixed edge of G if G -e + e' ~G implies e' = e. In this paper, we show that planar graphs with minimum degree 5 contain fixed edges, from which we prove that a class of planar graphs with minimum degree one is edge reconstructible.