Stable structure on safe set problems in vertex-weighted graphs
From MaRDI portal
Publication:2225416
DOI10.1016/j.ejc.2020.103211zbMath1458.05097arXiv1909.02718OpenAlexW3081454545MaRDI QIDQ2225416
Shinya Fujita, Boram Park, Tadashi Sakuma
Publication date: 8 February 2021
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.02718
Related Items (2)
A combinatorial branch and bound for the safe set problem ⋮ On the connected safe number of some classes of graphs
Cites Work
- Unnamed Item
- Safe set problem on graphs
- Dominating cliques in chordal graphs
- Safe sets in graphs: graph classes and structural parameters
- Safe number and integrity of graphs
- Approximating connected safe sets in weighted trees
- Parameterized complexity of safe set
- On the weighted safe set problem on paths and cycles
- Safe sets, network majority on weighted trees
- Contracting chordal graphs and bipartite graphs to paths and trees
This page was built for publication: Stable structure on safe set problems in vertex-weighted graphs