Blokkgráf (Hungarian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Blokkgráf" in Hungarian language version.

refsWebsite

Global rank Hungarian rank

2^nd place

8^th place

451^st place

1,456^th place

low place

ams.org

Lásd pl. MR 0659742, Robert E. Jamison egy 1983-as értékelését egy másik cikkről, ami a blokkgráfokat Husimi-fáknak nevezi; Jamison a hibát Mehdi Behzad és Gary Chartrand könyvének tulajdonítja.

Vušković, Kristina (2010), "Even-hole-free graphs: A survey", Applicable Analysis and Discrete Mathematics 4 (2): 219–240, DOI 10.2298/AADM100812027V.
Howorka, Edward (1979), "On metric properties of certain clique graphs", Journal of Combinatorial Theory, Series B 27 (1): 67–74, DOI 10.1016/0095-8956(79)90069-8.
Harary, Frank (1963), "A characterization of block-graphs", Canadian Mathematical Bulletin 6 (1): 1–6, DOI 10.4153/cmb-1963-001-x.
Bandelt, Hans-Jürgen & Mulder, Henry Martyn (1986), "Distance-hereditary graphs", Journal of Combinatorial Theory, Series B 41 (2): 182–208, DOI 10.1016/0095-8956(86)90043-2.
Edelman, Paul H. & Jamison, Robert E. (1985), "The theory of convex geometries", Geometriae Dedicata 19 (3): 247–270, DOI 10.1007/BF00149365.
Erdős, Paul; Saks, Michael & Sós, Vera T. (1986), "Maximum induced trees in graphs", Journal of Combinatorial Theory, Series B 41 (1): 61–79, DOI 10.1016/0095-8956(86)90028-6.
Călinescu, Gruia; Fernandes, Cristina G & Finkler, Ulrich et al. (2002), "A Better Approximation Algorithm for Finding Planar Subgraphs", Journal of Algorithms, 2 27: 269– 302, DOI 10.1006/jagm.1997.0920