Двойственно хордальный граф (Russian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Двойственно хордальный граф" in Russian language version.

refsWebsite

Global rank Russian rank

8doi.org

2^nd place

3^rd place

5archive.org

6^th place

9^th place

1mathnet.ru

8,783^rd place

1,078^th place

archive.org

Andreas Brandstädt, Victor Chepoi, Feodor Dragan. The algorithmic use of hypertree structure and maximum neighborhood orderings // Discrete Applied Mathematics. — 1998. — Т. 82. — С. 43–77. — doi:10.1016/s0166-218x(97)00125-x.
Andreas Brandstädt, Van Bang Le, Jeremy Spinrad. Graph Classes: A Survey. — SIAM Monographs on Discrete Mathematics and Applications, 1999. — ISBN 0-89871-432-X.
Marisa Gutierrez, Oubina. Metric Characterizations of proper Interval Graphs and Tree-Clique Graphs // Journal of Graph Theory. — 1996. — Т. 21. — С. 199–205. — doi:10.1002/(sici)1097-0118(199602)21:2<199::aid-jgt9>3.0.co;2-m.
Pablo De Caria, Marisa Gutierrez. On Minimal Vertex Separators of Dually Chordal Graphs: Properties and Characterizations // Discrete Applied Mathematics. — 2012. — Т. 160. — С. 2627–2635. — doi:10.1016/j.dam.2012.02.022.
Marina Moscarini. Doubly Chordal Graphs, Steiner trees and connected domination // Networks. — 1993. — Т. 23. — С. 59–69. — doi:10.1002/net.3230230108.

doi.org

dx.doi.org

Andreas Brandstädt, Victor Chepoi, Feodor Dragan. The algorithmic use of hypertree structure and maximum neighborhood orderings // Discrete Applied Mathematics. — 1998. — Т. 82. — С. 43–77. — doi:10.1016/s0166-218x(97)00125-x.
Marisa Gutierrez, Oubina. Metric Characterizations of proper Interval Graphs and Tree-Clique Graphs // Journal of Graph Theory. — 1996. — Т. 21. — С. 199–205. — doi:10.1002/(sici)1097-0118(199602)21:2<199::aid-jgt9>3.0.co;2-m.
Jayme L. Szwarcfiter, Claudson F. Bornstein. Clique Graphs of Chordal and Path Graphs // SIAM Journal on Discrete Mathematics. — 1994. — Т. 7. — С. 331–336. — doi:10.1137/s0895480191223191.
Andreas Brandstädt, Feodor Dragan, Victor Chepoi, Vitaly Voloshin. Dually Chordal Graphs // SIAM Journal on Discrete Mathematics. — 1998. — Т. 11. — С. 437–455. — doi:10.1137/s0895480193253415.
Pablo De Caria, Marisa Gutierrez. On Minimal Vertex Separators of Dually Chordal Graphs: Properties and Characterizations // Discrete Applied Mathematics. — 2012. — Т. 160. — С. 2627–2635. — doi:10.1016/j.dam.2012.02.022.
Boštjan Brešar. Intersection graphs of maximal hypercubes // European Journal of Combinatorics. — 2003. — Т. = 24. — С. 195–209. — doi:10.1016/s0195-6698(02)00142-7.
Marina Moscarini. Doubly Chordal Graphs, Steiner trees and connected domination // Networks. — 1993. — Т. 23. — С. 59–69. — doi:10.1002/net.3230230108.
Andreas Brandstädt, Victor Chepoi, Feodor Dragan. Distance approximating trees for chordal and dually chordal graphs // Journal of Algorithms. — 1999. — Т. 30. — С. 166–184. — doi:10.1006/jagm.1998.0962.

mathnet.ru

Feodor Dragan, Chiril Prisacaru, Victor Chepoi. Location problems in graphs and the Helly property (in Russian) // Discrete Math. (Moscow). — 1992. — Т. 4. — С. 67–73.; Ф. Ф. Драган, К. Ф. Присакарь, В. Д. Чепой. Задачи размещения на графах и свойство Хелли // Дискрет. матем.. — 1992. — Т. 4, вып. 4. — С. 67–73.; Федор Федорович Драган. Центры в графах и свойство Хелли. — Минск: АН БССР. Ин-т математики, 1989. — (автореферат дис. кандидата физико-математических наук: 01.01.09).