The discipline number of a graph

DOI10.1016/0012-365X(90)90360-TzbMath0747.05087OpenAlexW2078824348MaRDI QIDQ1174136

William Cook, Vašek Chvátal

Publication date: 25 June 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(90)90360-t

zbMATH Keywords

domination numbercomplete multipartite graphsbondage numberdiscipline number

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (05C99)

Related Items

Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday), Integer Programming Formulations for Minimum Spanning Tree Interdiction, Integer programming methods for solving binary interdiction games, Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations, A bound on the size of a graph with given order and bondage number, Bibliography on domination in graphs and some basic definitions of domination parameters, Bounds on the bondage number of a graph

Cites Work

• Domination alteration sets in graphs
• On graphs having domination number half their order
• Optimization of a 532-city symmetric traveling salesman problem by branch and cut
• The bondage number of a graph
• Unnamed Item