The bondage numbers of graphs with small crossing numbers
From MaRDI portal
Publication:882111
DOI10.1016/J.DISC.2006.09.035zbMATH Open1118.05073OpenAlexW2104036951MaRDI QIDQ882111FDOQ882111
Authors: Jia Huang, Jun-Ming Xu
Publication date: 23 May 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.09.035
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
Cited In (7)
- Bondage number of planar graphs without small cycles
- The \(p\)-bondage number of trees
- The bondage number of graphs with crossing number less than four
- On bondage numbers of graphs: a survey with some comments
- Bondage number of mesh networks
- The structure and the bondage number of three classes of beyond-planar graphs
- The total bondage number of grid graphs
This page was built for publication: The bondage numbers of graphs with small crossing numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q882111)