๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A Note on Products of Finite Structures with an Application to Graphs

โœ Scribed by Wilkie, A. J.

Book ID
120096353
Publisher
Oxford University Press
Year
1976
Tongue
English
Weight
61 KB
Volume
s2-14
Category
Article
ISSN
0024-6107

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On Structure of Some Plane Graphs with A
On Structure of Some Plane Graphs with Application to Choosability
โœ Peter Che Bor Lam; Wai Chee Shiu; Baogang Xu ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 180 KB

A graph G=(V, E) is (x, y)-choosable for integers x> y 1 if for any given family In this paper, structures of some plane graphs, including plane graphs with minimum degree 4, are studied. Using these results, we may show that if G is free of k-cycles for some k # [3,4,5,6], or if any two triangles

Note on the reconstruction of infinite g
Note on the reconstruction of infinite graphs with a fixed finite number of components
โœ Thomas Andreae ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 169 KB ๐Ÿ‘ 1 views

For every positive integer c , we construct a pair G, , H, of infinite, nonisomorphic graphs both having exactly c components such that G, and H, are hypomorphic, i.e., G, and H, have the same families of vertex-deleted subgraphs. This solves a problem of Bondy and Hemminger. Furthermore, the pair G