✦ LIBER ✦

Computing the binding number of a graph

✍ Scribed by William H. Cunningham

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 189 KB
Volume: 27
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(90)90072-k

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing the isoperimetric number of a

Computing the isoperimetric number of a graph

✍ P. A. Golovach 📂 Article 📅 1994 🏛 Springer US 🌐 English ⚖ 279 KB

The binding number of Halin graphs

✍ Mirosława Skowrońska 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 304 KB

The binding numbers of some Cartesian pr

The binding numbers of some Cartesian products of graphs

✍ Danuta Michalak 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 238 KB

In the paper we obtain some conditions under which the binding number bind (C) of a Cartesian product graph G is equal to The concept of the binding number of a graph was introduced by Woodall in 1973 . The main theorem of Woodall's paper is a sufficient condition for the existence of a Hamiltonian

Binding numbers and f-factors of graphs

✍ Mikio Kano; Norihide Tokushige 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 351 KB

A graph-theoretic algorithm for computin

A graph-theoretic algorithm for computing the number of invariant zeros of large scale systems

✍ F.Svaricek Duisburg 📂 Article 📅 1985 🏛 Elsevier Science ⚖ 250 KB

The discipline number of a graph

✍ V. Chvátal; W. Cook 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 481 KB