✦ LIBER ✦

On the fixed edge of planar graphs with minimum degree five

✍ Scribed by Baogang Xu; Hongbing Fan

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 207 KB
Volume: 152
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)00280-v

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

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 graphs with equal edge-connectivity a

On graphs with equal edge-connectivity and minimum degree

✍ Donald L. Goldsmith; Arthur T. White 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 599 KB

It was proved by Chartrand f hat if G is a graph of order p for which the minimum degree is at least [&I, then the edge-connectivity of G equals the minimum degree of G. It is shown here that one may allow vertices of degree less than $p and still obtain the same conclusion, provided the degrees are

On graphs with equal edge connectivity a

On graphs with equal edge connectivity and minimum degree

✍ Béla Bollobás 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 255 KB

If a grrrph G hao edge connectivity A then the vertex fiat ha a partition V(a) = U U W ash that 61 esntainti exactly A edgea from U to W, Wen~se if Qo ia a maximal graph of order n and edge connectivity A than C$, is sbtctined from the dkjsint union of two complete oubgragh8, B,[U] and &T,[ Wg, by a

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

Edge-reconstruction of planar graphs wit

Edge-reconstruction of planar graphs with minimum valency 5

✍ Josef Lauri 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 780 KB

## Abstract The object of this paper is to show tht every planar graph of minimum valency 5 is reconstructible from its family of edge‐deleted subgraphs.

On the edge-reconstruction of 3-connecte

On the edge-reconstruction of 3-connected planar graphs with minimum valency 4

✍ Yue Zhao 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 550 KB

It is shown that a 3-connected planar graph with minimum valency 4 is edge-reconstructible if no 4-vertex is adjacent to a 5-vertex. ## 1. Introduction In this paper, all graphs G=(V(G),E(G)) considered will be finite and simple. A connected graph G is said to have connectivity k o = ko(G) if the