Number of the records: 1  

Strongly geodetic graphs

  1. TitleStrongly geodetic graphs
    Author Bosák Juraj SAVMATEM - Matematický ústav SAV
    Co-authors Kotzig A. SAVMATEM - Matematický ústav SAV

    Co-authors Znám Š.
    Source documentJournal of Combinatorial Theory. Vol. 5 (1968), p. 170-176
    Languageeng - English
    CountryUS - United States of America
    Document kindrozpis článkov z periodík (rbx)
    CitationsNGUYEN, M.H. - MILLER, M. Moore bound for mixed networks. In DISCRETE MATHEMATICS. ISSN 0012-365X, DEC 6 2008, vol. 308, no. 23, p. 5499-5503.
    QIAO, Pu - ZHAN, Xingzhi. The maximum girth and minimum circumference of graphs with prescribed radius and diameter. In DISCRETE MATHEMATICS. ISSN 0012-365X, 2018, vol. 341, no. 10, p. 2827-2830.
    MILLER, Mirka. Moore graphs and beyond: A survey of the degree/diameter problem. In Electronic Journal of Combinatorics, 2018, vol. 1, dynamicSurveys.
    JAJCAY, Robert - LEKAR, Milan. The Impact of Emigration on Slovak Mathematics: The Case of the Bratislava Graph Theory Seminar. In MATHEMATICAL INTELLIGENCER, 2021, vol. 43, no. 1, pp. 45-53. ISSN 0343-6993. Dostupné na: https://doi.org/10.1007/s00283-020-09993-x.
    CIZMA, Daniel - LINIAL, Nati. Geodesic Geometry on Graphs. In DISCRETE & COMPUTATIONAL GEOMETRY, 2022, vol. 68, no. 1, pp. 298-347. ISSN 0179-5376. Dostupné na: https://doi.org/10.1007/s00454-021-00345-w.
    CIZMA, Daniel - LINIAL, Nati. Irreducible nonmetrizable path systems in graphs. In JOURNAL OF GRAPH THEORY, 2023, vol. 102, no. 1, pp. 5-14. ISSN 0364-9024. Dostupné na: https://doi.org/10.1002/jgt.22854.
    CategoryADCA - Scientific papers in foreign journals registered in Current Contents Connect with IF (impacted)
    Category of document (from 2022)V3 - Vedecký výstup publikačnej činnosti z časopisu
    Type of documentčlánok
    Year1968
    article

    article

    rokCCIFIF Q (best)JCR Av Jour IF PercSJRSJR Q (best)CiteScore
    A
    rok vydaniarok metrikyIFIF Q (best)SJRSJR Q (best)
    1968
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.