✦ LIBER ✦

An edge-deletion problem for locally finite graphs

✍ Scribed by Thomas Andreae

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 511 KB
Volume: 33
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(82)90067-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An edge coloring problem for graph produ

An edge coloring problem for graph products

✍ Faudree, R. J.; Gy�rf�s, Andr�as; Schelp, R. H. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 315 KB 👁 1 views

The edges of the Cartesian product of graphs G x H a r e to be colored with the condition that all rectangles, i.e., K2 x K2 subgraphs, must be colored with four distinct colors. The minimum number of colors in such colorings is determined for all pairs of graphs except when G is 5-chromatic and H

On the hamiltonicity of line graphs of l

On the hamiltonicity of line graphs of locally finite, 6-edge-connected graphs

✍ Richard C. Brewster; Daryl Funk 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 124 KB

## Abstract The topological approach to the study of infinite graphs of Diestel and KÜhn has enabled several results on Hamilton cycles in finite graphs to be extended to locally finite graphs. We consider the result that the line graph of a finite 4‐edge‐connected graph is hamiltonian. We prove a

On the edge forwarding index problem for

On the edge forwarding index problem for small graphs

✍ Abdelmadjid Bouabdallah; Dominique Sotteau 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 540 KB

Cycle-cocycle partitions and faithful cy

Cycle-cocycle partitions and faithful cycle covers for locally finite graphs

✍ Henning Bruhn; Reinhard Diestel; Maya Stein 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB

## Abstract By a result of Gallai, every finite graph __G__ has a vertex partition into two parts each inducing an element of its cycle space. This fails for infinite graphs if, as usual, the cycle space is defined as the span of the edge sets of finite cycles in __G__. However, we show that, for t

Searching for an edge in a graph

✍ M. Aigner; E. Triesch 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 484 KB

Anti-plane shear problem for an edge cra

Anti-plane shear problem for an edge crack in a finite orthotropic plate

✍ Y.H. Wang; Y.K. Cheung; C.W. Woo 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 425 KB

The problem of an edge crack in a finite orthotropic plate under anti-plane shear is considered. The boundary collocation method is used to calculate the mode III stress intensity factor (SF). For the case in which the material is isotropic, the present results agree very well with those obtained by