𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Structural properties for certain classes of infinite planar graphs

✍ Scribed by Hwan-Ok Jung

Publisher
Springer-Verlag
Year
2003
Tongue
English
Weight
157 KB
Volume
13
Category
Article
ISSN
1598-5865

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Core-like properties of infinite graphs
Core-like properties of infinite graphs and structures
✍ B. Bauslaugh πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 554 KB

We define several properties of infinite graphs (structures) which are analogous to the property of being a core in a finite graph. We describe completely the relationships between these properties. We also show which of these properties are invariant under homomorphic equivalence.

Characterization of a class of triangle-
Characterization of a class of triangle-free graphs with a certain adjacency property
✍ Brian Alspach; C. C. Chen; Katherine Heinrich πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 597 KB

## Abstract Let __m__ and __n__ be nonnegative integers. Denote by __P__(__m,n__) the set of all triangle‐free graphs __G__ such that for any independent __m__‐subset __M__ and any __n__‐subset __N__ of __V__(__G__) with __M__ ∩ __N__ = Ø, there exists a unique vertex of __G__ that is adjacent to e

The complexity of the matching-cut probl
The complexity of the matching-cut problem for planar graphs and other graph classes
✍ Paul Bonsma πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 247 KB

## Abstract The Matching‐Cut problem is the problem to decide whether a graph has an edge cut that is also a matching. Previously this problem was studied under the name of the Decomposable Graph Recognition problem, and proved to be ${\cal{NP}}$‐complete when restricted to graphs with maximum deg