Bondage number of planar graphs
From MaRDI portal
Publication:1579562
DOI10.1016/S0012-365X(99)00405-7zbMath0961.05055OpenAlexW2036334548MaRDI QIDQ1579562
Publication date: 28 May 2001
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00405-7
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (23)
A BOUND ON THE BONDAGE NUMBER OF TOROIDAL GRAPHS ⋮ A note on the Roman bondage number of planar graphs ⋮ The bondage numbers of graphs with small crossing numbers ⋮ Upper bounds for the bondage number of graphs on topological surfaces ⋮ Independent bondage number of planar graphs with minimum degree at least 3 ⋮ Independent bondage number of a graph ⋮ Non-isolating 2-bondage in graphs ⋮ On bondage numbers of graphs: a survey with some comments ⋮ Bondage number of grid graphs ⋮ An improved upper bound for the bondage number of graphs on surfaces ⋮ Unnamed Item ⋮ The \(p\)-bondage number of trees ⋮ On the Roman bondage number of planar graphs ⋮ Bondage number of mesh networks ⋮ Upper bounds for the domination subdivision and bondage numbers of graphs on topological surfaces ⋮ On the bondage number of planar and directed graphs ⋮ The total bondage number of grid graphs ⋮ Non-isolating bondage in graphs ⋮ Bondage numbers of Mycielski graphs ⋮ Paired bondage in trees ⋮ Reinforcement numbers of digraphs ⋮ 2-bondage in graphs ⋮ Upper bounds on the bondage number of a graph
This page was built for publication: Bondage number of planar graphs