✦ LIBER ✦

Neighborhood subtree tolerance graphs

✍ Scribed by Eric Bibelnieks; P.M. Dearing

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 906 KB
Volume: 43
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(93)90165-k

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Subtrees and Subforests of Graphs

✍ S. Brandt 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 299 KB

In this paper we present sufficient edge-number and degree conditions for a graph to contain all forests of given size. The edge-number bound answers in the aflirmative a conjecture due to Erdős and Sós. Furthermore, we will give improved bounds for specified spanning subtrees of graphs. 1994 Academ

Neighborhood perfect graphs

✍ J Lehel; Zs Tuza 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 595 KB

The notion of neighborhood perfect graphs is introduced here as follows. Let G be a graph, ~N(G) denote the maximum number of edges such that no two of them belong to the same subgraph of G induced by the (closed) neighborhood of some vertex; let PN(G) be the minimum number of vertices whose neighbo

Tolerance graphs

✍ Martin Charles Golumbic; Clyde L. Monma; William T. Trotter Jr. 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 756 KB

Intersection graphs of Helly families of

Intersection graphs of Helly families of subtrees

✍ Fǎnicǎ Gavril 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 964 KB

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

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