✦ LIBER ✦

Extremal problems involving neighborhood unions

✍ Scribed by Ralph J. Faudree; Ronald J. Gould; Michael S. Jacobson; Richard H. Schelp

Publisher: John Wiley and Sons
Year: 1987
Tongue: English
Weight: 393 KB
Volume: 11
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190110413

No coin nor oath required. For personal study only.

✦ Synopsis

We examine several extremal problems for graphs satisfying the property JN(x) u N(y)l ? s f o r every pair of nonadjacent vertices x , y E V ( G ) .

In particular, values for s are found that ensure that the graph contains an s-matching, a 1-factor, a path of a specific length, or a cycle of a specific length.

📜 SIMILAR VOLUMES

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

Extremal problems for chromatic neighbor

Extremal problems for chromatic neighborhood sets

✍ André Kündgen; Michael Molloy 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 79 KB

## Abstract The chromatic neighborhood sequence of a graph G is the list of the chromatic numbers of the subgraphs induced by the neighborhoods of the vertices. We study the maximum multiplicity of this sequence, proving, amongst other things, that if a chromatic neighborhood sequence has __t__ dis