✦ LIBER ✦

Edge Separators of Planar and Outerplanar Graphs With Applications

✍ Scribed by K. Diks; H.N. Djidjev; O. Sykora; I. Vrto

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 816 KB
Volume: 14
Category: Article
ISSN: 0196-6774
DOI: 10.1006/jagm.1993.1013

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Acyclic edge chromatic number of outerpl

Acyclic edge chromatic number of outerplanar graphs

✍ Jian-Feng Hou; Jian-Liang Wu; Gui-Zhen Liu; Bin Liu 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 176 KB

## Abstract A proper edge coloring of a graph __G__ is called acyclic if there is no 2‐colored cycle in __G__. The acyclic edge chromatic number of __G__, denoted by χ(__G__), is the least number of colors in an acyclic edge coloring of __G__. In this paper, we determine completely the acyclic edge

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.

Edges and Kuratowski Subgraphs of Non-Pl

Edges and Kuratowski Subgraphs of Non-Planar Graphs

✍ Jozef Širáň 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 225 KB

It is proved that any edge of a Pconnected non-planar graph G of order a t least 6 lies in a subdivision of K3,3 in G. For any 3-connected non-planar graph G of order a t least 6 we show that G contains at most four edges which belong to no subdivisions of K3,3 in G.

Edge-reconstruction of 4-connected plana

Edge-reconstruction of 4-connected planar graphs

✍ S. Fiorini; J. Lauri 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 482 KB 👁 2 views

## Abstract The object of this paper is to show that 4‐connected planar graphs are uniquely determined from their collection of edge‐deleted subgraphs.

Acyclic edge coloring of triangle-free p

Acyclic edge coloring of triangle-free planar graphs

✍ Manu Basavaraju; L. Sunil Chandran 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 233 KB 👁 2 views

An __acyclic__ edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The __acyclic chromatic index__ of a graph is the minimum number __k__ such that there is an acyclic edge coloring using __k__ colors and is denoted by __a__′(__G__). It was conjectured by Al

Straight line embeddings of cubic planar

Straight line embeddings of cubic planar graphs with integer edge lengths

✍ Jim Geelen; Anjie Guo; David McKinnon 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 87 KB

## Abstract We prove that every simple cubic planar graph admits a planar embedding such that each edge is embedded as a straight line segment of integer length. © 2008 Wiley Periodicals, Inc. J Graph Theory 58:270‐274, 2008