THE RECONSTRUCTION OF MAXIMAL PLANAR GRAPHS .1. RECOGNITION

被引：9
|
作者：
FIORINI, S
LAURI, J
机构：
来源：
JOURNAL OF COMBINATORIAL THEORY SERIES B | 1981年 / 30卷 / 02期
关键词：
D O I：
10.1016/0095-8956(81)90063-0
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：188 / 195
页数：8
相关论文
共 50 条
  • [21] MAXIMAL PLANAR GRAPHS OF DIAMETER 2
    SEYFFARTH, K
    JOURNAL OF GRAPH THEORY, 1989, 13 (05) : 619 - 648
  • [22] On the tightness conditions for maximal planar graphs
    Department of Mathematics, Han-Shin University, Osan 447-791, Korea, Republic of
    J. Appl. Math. Comp., 1 (235-241):
  • [23] On the tightness conditions for maximal planar graphs
    Hwan -Ok Jung
    Korean Journal of Computational & Applied Mathematics, 1997, 4 (1): : 235 - 241
  • [24] Bounded Stub Resolution for Some Maximal 1-Planar Graphs
    Kaufmann, Michael
    Kratochvil, Jan
    Lipp, Fabian
    Montecchiani, Fabrizio
    Raftopoulou, Chrysanthi
    Valtr, Pavel
    ALGORITHMS AND DISCRETE APPLIED MATHEMATICS, CALDAM 2018, 2018, 10743 : 214 - 220
  • [25] Research progress on the theory of maximal planar graphs
    Xu, Jin
    Li, Ze-Peng
    Zhu, En-Qiang
    Jisuanji Xuebao/Chinese Journal of Computers, 2015, 38 (08): : 1680 - 1704
  • [26] Symmetry breaking in planar and maximal outerplanar graphs
    Alikhani, Saeid
    Soltani, Samaneh
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2019, 11 (01)
  • [27] Total Coloring of Dumbbell Maximal Planar Graphs
    Zhou, Yangyang
    Zhao, Dongyang
    Ma, Mingyuan
    Xu, Jin
    MATHEMATICS, 2022, 10 (06)
  • [28] Maximal Biconnected Subgraphs of Random Planar Graphs
    Panagiotou, Konstantinos
    Steger, Angelika
    ACM TRANSACTIONS ON ALGORITHMS, 2010, 6 (02)
  • [29] Edge-disjoint maximal planar graphs
    Boswell, SG
    Simpson, J
    DISCRETE MATHEMATICS, 1998, 179 (1-3) : 235 - 241
  • [30] The maximum Wiener index of maximal planar graphs
    Ghosh, Debarun
    Gyori, Ervin
    Paulos, Addisu
    Salia, Nika
    Zamora, Oscar
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2020, 40 (04) : 1121 - 1135
12345