𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Two characterizations of chain partitioned probe graphs

✍ Scribed by Van Bang Le

Book ID
106344965
Publisher
Springer US
Year
2010
Tongue
English
Weight
282 KB
Volume
188
Category
Article
ISSN
0254-5330

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A characterization of chain probe graphs
A characterization of chain probe graphs
✍ Martin C. Golumbic; FrΓ©dΓ©ric Maffray; GrΓ©gory Morel πŸ“‚ Article πŸ“… 2009 πŸ› Springer US 🌐 English βš– 385 KB
Two characterizations of interchange gra
Two characterizations of interchange graphs of complete m-partite graphs
✍ Curtis R. Cook πŸ“‚ Article πŸ“… 1974 πŸ› Elsevier Science 🌐 English βš– 564 KB

A graph G is m-partite if its points can be partitioned into m subsets Yl, . . . . Vm such that every line joins a point in Vi with a point in Vi, i + j. A complete m-partite graph contains every line joining Vi with V-. A complete graph Kp has every pair of its p points adjacent. The nth interchang

Spanning subgraphs of graphs partitioned
Spanning subgraphs of graphs partitioned into two isomorphic pieces
✍ Anthony Bonato πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 124 KB

## Abstract A graph has the neighbor‐closed‐co‐neighbor, or ncc property, if for each of its vertices __x__, the subgraph induced by the neighbor set of __x__ is isomorphic to the subgraph induced by the closed non‐neighbor set of __x__. As proved by Bonato and Nowakowski [5], graphs with the ncc p

Partition of a bipartite hamiltonian gra
Partition of a bipartite hamiltonian graph into two cycles
✍ Denise Amar πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 480 KB

We prove the following theorem. "I'neorem. If G is a balanced bipartite graph with bipartition (A, B), [A I = IBI = n, such that for any x ~ A, y ~ B, d(x) + d(y) >>-n + 2, then for any (nl, n2), ni >I 2, n -----n I + hE, G contains two independent cycles of lengths 2nl and 2n2.