✦ LIBER ✦

On the minimum feasible graph for four sets

✍ Scribed by Yinfeng Xu; Xiaobing Fu

Book ID: 112818358
Publisher: SP Editorial Committee of Applied Mathematics - A Journal of Chinese Universities
Year: 1995
Tongue: English
Weight: 245 KB
Volume: 10
Category: Article
ISSN: 1005-1031
DOI: 10.1007/bf02662501

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On minimum maximal independent sets of a

On minimum maximal independent sets of a graph

✍ Julie Haviland 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 638 KB

On the feasible tree-diameter sets of gr

On the feasible tree-diameter sets of graphs

✍ Shimizu, T.; Shibata, Y. 📂 Article 📅 1985 🏛 IEEE ⚖ 243 KB

On minimum rank and zero forcing sets of

On minimum rank and zero forcing sets of a graph

✍ Liang-Hao Huang; Gerard J. Chang; Hong-Gwa Yeh 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 217 KB

On minimum intersection of two minimum d

On minimum intersection of two minimum dominating sets of interval graphs

✍ Chang Maw-Shang; Hsu Chung-Chang 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 748 KB

This paper gives linear-time algorithms for finding two minimum (connected) dominating sets with minimum intersection for interval graphs.

On point-set domination in graphs IV: Se

On point-set domination in graphs IV: Separable graphs with unique minimum psd-sets

✍ B.D. Acharya; Purnima Gupta 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 675 KB

A set D of vertices in a graph G =-(V,E) is called a point-set dominating (or, psd-) set of G if for every nonempty subset S of V -D there exists v E D such that the induced subgraph (S U {v}) is connected (cf. Sampthkumar and Pushpa Latha (1993) [6]). Here, we report results of our investigation in

On minimum sets of 1-factors covering a

On minimum sets of 1-factors covering a complete multipartite graph

✍ David Cariolaro; Hung-Lin Fu 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 132 KB 👁 1 views

## Abstract We determine necessary and sufficient conditions for a complete multipartite graph to admit a set of 1‐factors whose union is the whole graph and, when these conditions are satisfied, we determine the minimum size of such a set. © 2008 Wiley Periodicals, Inc. J Graph Theory 58:239‐250,