✦ LIBER ✦

Edge search in graphs with restricted test sets

✍ Scribed by T. Gerzen

Book ID: 108114147
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 669 KB
Volume: 309
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2009.04.013

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Eulerian edge sets in locally finite gra

Eulerian edge sets in locally finite graphs

✍ Eli Berger; Henning Bruhn 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 279 KB

Graphs with unique minimum edge dominati

Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices

✍ Jerzy Topp 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 816 KB

Topp, J., Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices, Discrete Mathematics 12 1 (1993) 199-210. A set I of vertices of a graph G is an independent set if no two vertices of I are adjacent. A set M of edges of G is an edge dominating s

Searching for an edge in a graph

✍ M. Aigner; E. Triesch 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 484 KB

Local maximum stable sets in bipartite g

Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings

✍ Vadim E. Levit; Eugen Mandrescu 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 233 KB

A maximum stable set in a graph G is a stable set of maximum size. S is a local maximum stable set of G, and we write S ∈ (G), if S is a maximum stable set of the subgraph spanned by S ∪ N (S), where N (S) is the neighborhood of S. A matching M is uniquely restricted if its saturated vertices induce

Packing k-edge trees in graphs of restri

Packing k-edge trees in graphs of restricted vertex degrees

✍ A.K. Kelmans 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 368 KB 👁 1 views

## Abstract Let ${\cal G}^{s}\_{r}$ denote the set of graphs with each vertex of degree at least __r__ and at most __s__, __v__(__G__) the number of vertices, and τ~__k__~ (__G__) the maximum number of disjoint __k__‐edge trees in __G__. In this paper we show that if __G__ ∈ ${\cal G}^{s}\_{2}$ a

Edge search in graphs and hypergraphs of

Edge search in graphs and hypergraphs of bounded rank

✍ Ingo Althöfer; Eberhard Triesch 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 512 KB

Althofer, 1. and E. Triesch, Edge search in graphs and hypergraphs of bounded rank, Discrete Mathematics 115 (1993) l-9.