✦ LIBER ✦

The Linking of Sets in Graphs

✍ Scribed by Pym, J. S.

Book ID: 120097065
Publisher: Oxford University Press
Year: 1969
Tongue: English
Weight: 239 KB
Volume: s1-44
Category: Article
ISSN: 0024-6107
DOI: 10.1112/jlms/s1-44.1.542

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Connected dominating sets in disk graphs

Connected dominating sets in disk graphs with bidirectional links

✍ Thai, M.T.; Du, D.-Z. 📂 Article 📅 2006 🏛 IEEE 🌐 English ⚖ 138 KB

Efficient sets in graphs

✍ P.J. Bernhard; S.T. Hedetniemi; D.P. Jacobs 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 625 KB

F-Sets in graphs

✍ V Krishnamoorthy; K.R Parthasarathy 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 453 KB

Tutte sets in graphs I: Maximal tutte se

Tutte sets in graphs I: Maximal tutte sets and D-graphs

✍ D. Bauer; H. J. Broersma; A. Morgana; E. Schmeichel 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 177 KB

## Abstract A well‐known formula of Tutte and Berge expresses the size of a maximum matching in a graph __G__ in terms of what is usually called the deficiency of __G__. A subset __X__ of __V__(__G__) for which this deficiency is attained is called a Tutte set of __G__. While much is known about ma

Independent sets in regular graphs

✍ M. Rosenfeld 📂 Article 📅 1964 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 449 KB

Nearly perfect sets in graphs

✍ Jean E. Dunbar; Frederick C. Harris Jr; Sandra M. Hedetniemi; Stephen T. Hedetni 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 871 KB

In a graph G = (V, E), a set of vertices S is nearly perfect if every vertex in V-S is adjacent to at most one vertex in S. Nearly perfect sets are closely related to 2-packings of graphs, strongly stable sets, dominating sets and efficient dominating sets. We say a nearly perfect set S is 1-minimal