Author:
Belmonte Rémy,Fomin Fedor V.,Golovach Petr A.,Ramanujan M. S.
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. Bodlaender, H.L., Thilikos, D.M.: Treewidth for graphs with small chordality. Discrete Appl. Math. 79(1–3), 45–61 (1997)
2. Chandran, L.S., Lozin, V.V., Subramanian, C.R.: Graphs of low chordality. Discrete Math. & Theor. Comput. Sci. 7(1), 25–36 (2005).
www.dmtcs.org/volumes/abstracts/dm070103.abs.html
3. Chartrand, G., Eroh, L., Johnson, M.A., Oellermann, O.: Resolvability in graphs and the metric dimension of a graph. Discrete Appl. Math. 105(1–3), 99–113 (2000)
4. Lecture Notes in Computer Science;J Díaz,2012
5. Dourisboure, Y., Gavoille, C.: Tree-decompositions with bags of small diameter. Discrete Math. 307(16), 2008–2029 (2007)
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Source detection on graphs;Optimization and Engineering;2023-12-04
2. The Threshold Dimension and Threshold Strong Dimension of a Graph: A Survey;Association for Women in Mathematics Series;2021
3. The threshold dimension of a graph;Discrete Applied Mathematics;2020-12
4. The threshold dimension and irreducible graphs;Discussiones Mathematicae Graph Theory;2020
5. Iterated Type Partitions;Lecture Notes in Computer Science;2020