𝔖 Bobbio Scriptorium
✦   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

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


The binding number of Halin graphs
✍ MirosΕ‚awa SkowroΕ„ska πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 304 KB
The binding numbers of some Cartesian pr
✍ 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
The discipline number of a graph
✍ V. ChvΓ‘tal; W. Cook πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 481 KB