The discipline number of a graph
From MaRDI portal
Publication:1174136
Recommendations
Cites work
Cited in
(7)- Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday)
- A bound on the size of a graph with given order and bondage number
- Bounds on the bondage number of a graph
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations
- Integer Programming Formulations for Minimum Spanning Tree Interdiction
- Integer programming methods for solving binary interdiction games
- Bibliography on domination in graphs and some basic definitions of domination parameters
This page was built for publication: The discipline number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1174136)