All Outputs (92)

Estimations of the binding number of graphs with a large girth (1990)
Report
Zverovich, V., & Zverovich, I. (1990). Estimations of the binding number of graphs with a large girth

On the binding number of graphs (1990)
Journal Article
Zverovich, V., & Zverovich, I. (1990). On the binding number of graphs

Computational aspects of graph-optimisation problems connected with hamiltonity and k-factors (1989)
Presentation / Conference
Zverovich, V., & Zverovich, I. (1989, June). Computational aspects of graph-optimisation problems connected with hamiltonity and k-factors. Presented at Regional Conference on Applications of Inform. and Comput. to Industr. Problems, Minsk, Belarus

On domination and irredundance in graphs (1989)
Report
Zverovich, V. (1989). On domination and irredundance in graphs

The binding number of a graph (1989)
Journal Article
Zverovich, V. (1989). The binding number of a graph

Domistable graphs (1989)
Report
Zverovich, V., & Zverovich, I. (1989). Domistable graphs

Conjectures on the binding number of a graph (1988)
Presentation / Conference
Zverovich, V., & Zverovich, I. (1988, June). Conjectures on the binding number of a graph. Presented at The 8th All-Union Conference on Problems of Theoretical Cybernetics, Gorki, Russia

Some results on forcibly n-colourable and forcibly i-cyclic sequences (1988)
Report
Zverovich, V., Zverovich, I., & Sylla, A. (1988). Some results on forcibly n-colourable and forcibly i-cyclic sequences

A solution of one problem on domatically cocritical graphs (1988)
Report
Zverovich, V. (1988). A solution of one problem on domatically cocritical graphs

Some classes of minimaximal graphs (1988)
Report
Zverovich, V., & Zverovich, I. (1988). Some classes of minimaximal graphs

Threat assessment algorithm for prioritisation of moving objects in a secure compound
Report
Zverovich, V. (2015). Threat assessment algorithm for prioritisation of moving objects in a secure compound

In this report, a threat assessment algorithm for prioritisation of moving objects in a secure compound is presented.

A proof of Woodall's conjecture on the binding number
Report
Zverovich, V. (1993). A proof of Woodall's conjecture on the binding number