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

The hamiltonicity of bipartite graphs involving neighborhood unions

โœ Scribed by Guantao Chen; Akira Saito; Bing Wei; Xuerong Zhang

Book ID
108315677
Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
119 KB
Volume
249
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Neighborhood unions and hamiltonicity of
Neighborhood unions and hamiltonicity of graphs
โœ Ruqun Shen; Feng Tian ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 530 KB

Let G be a graph of order n. In this paper, we prove that if G is a 2-connected graph of order n such that for all u, ve V(G), 2 where dist(u,v) is the distance between u and v in G, then either G is hamiltonian, or G is a spanning subgraph of a graph in one of three families of exceptional graphs.

Hamiltonian graphs involving neighborhoo
Hamiltonian graphs involving neighborhood unions
โœ Guantao Chen; Warren E. Shreve; Bing Wei ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 214 KB

## Abstract Dirac proved that a graph __G__ is hamiltonian if the minimum degree $\delta(G) \geq n/2$, where __n__ is the order of __G__. Let __G__ be a graph and $A \subseteq V(G)$. The neighborhood of __A__ is $N(A)=\{ b: ab \in E(G)$ for some $a \in A\}$. For any positive integer __k__, we show

Neighborhood hypergraphs of bipartite gr
Neighborhood hypergraphs of bipartite graphs
โœ Endre Boros; Vladimir Gurvich; Igor Zverovich ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 252 KB

## Abstract Matrix symmetrization and several related problems have an extensive literature, with a recurring ambiguity regarding their complexity and relation to graph isomorphism. We present a short survey of these problems to clarify their status. In particular, we recall results from the litera