U. Teschner, “New Results about the Bondage Number of a Graph,” Discrete Mathematics, Vol. 171, No. 1-3, 1997, pp. 249-259.

has been cited by the following article:

• TITLE: Bondage Number of 1-Planar Graph

  AUTHORS: Qiaoling Ma, Sumei Zhang, Jihui Wang

  KEYWORDS: Domination Number, Bondage number, 1-Planar Graph, Combinatorial Problem

  JOURNAL NAME: Applied Mathematics, Vol.1 No.2, July 22, 2010

  ABSTRACT: The bondage number of a nonempty graph G is the cardinality of a smallest set of edges whose removal from G results in a graph a domination number greater than the domination number of G. In this paper, we prove that for a 1-planar graph G.