✦ LIBER ✦

Topological aspects of edge fusions in 4-graphs

✍ Scribed by Massimo Ferri; Sóstenes Lins

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 820 KB
Volume: 51
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(91)90038-l

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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.

Graphs of degree 4 are 5-edge-choosable

✍ Juvan, Martin; Mohar, Bojan; ??krekovski, Riste 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 312 KB 👁 1 views

It is shown that every simple graph with maximal degree 4 is 5-edgechoosable.

A charcterization of 4-edge-connected eu

A charcterization of 4-edge-connected eulerian graphs

✍ Peter Weidl 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 594 KB

## Abstract Let __v__ be an arbitrary vertex of a 4‐edge‐connected Eulerian graph __G__. First we show the existence of a nonseparating cycle decompositiion of __G__ with respect to __v__. With the help of this decomposition we are then able to construct 4 edge‐independent spanning trees with the c

Topological Minors in Graphs of Large Gi

Topological Minors in Graphs of Large Girth

✍ Daniela Kühn; Deryk Osthus 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 204 KB

We prove that every graph of minimum degree at least r and girth at least 186 contains a subdivision of K rþ1 and that for r5435 a girth of at least 15 suffices. This implies that the conjecture of Haj ! o os that every graph of chromatic number at least r contains a subdivision of K r (which is fal

Dependent edges in Mycielski graphs and

Dependent edges in Mycielski graphs and 4-colorings of 4-skeletons

✍ Karen L. Collins; Kimberly Tysdal 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 174 KB 👁 1 views

## Abstract A dependent edge in an acyclic orientation of a graph is one whose reversal creates a directed cycle. In answer to a question of Erdös, Fisher et al. [5] define __d__~min~(__G__) to be the minimum number of dependent edges of a graph __G__, where the minimum is taken over all acyclic or

Topological aspects of conformational tr

Topological aspects of conformational transformations in proteins

✍ S. Chiavarini; P. De Santis; S. Morosetti; A. Palleschi 📂 Article 📅 1984 🏛 Wiley (John Wiley & Sons) 🌐 English ⚖ 656 KB

The topological aspects of the conformational transformations in proteins are investigated using a new peptide-ribbon representation of the tertiary structure. The topological parameters evaluated on a set of 49 proteins show striking regularities that extend beyond the secondary structures actually