The binding number for random graphs
(1992)
Report
Zverovich, V. (1992). The binding number for random graphs
All Outputs (9)
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 domination and irredundance in graphs (1989)
Report
Zverovich, V. (1989). On domination and irredundance in graphs
Domistable graphs (1989)
Report
Zverovich, V., & Zverovich, I. (1989). Domistable graphs
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
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
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 compoundIn 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