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 条
  • [31] On dominating sets of maximal outerplanar and planar graphs
    Li, Zepeng
    Zhu, Enqiang
    Shao, Zehui
    Xu, Jin
    DISCRETE APPLIED MATHEMATICS, 2016, 198 : 164 - 169
  • [32] 2 TREES IN MAXIMAL PLANAR BIPARTITE GRAPHS
    RINGEL, G
    JOURNAL OF GRAPH THEORY, 1993, 17 (06) : 755 - 758
  • [33] The Enumeration of Flippable Edges in Maximal Planar Graphs
    Zhao, Dongyang
    Zhou, Yangyang
    Xu, Jin
    2017 IEEE INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION TECHNOLOGY (CIT), 2017, : 261 - 267
  • [34] SPANNING MAXIMAL PLANAR SUBGRAPHS OF RANDOM GRAPHS
    BOLLOBAS, B
    FRIEZE, AM
    RANDOM STRUCTURES & ALGORITHMS, 1991, 2 (02) : 225 - 231
  • [35] On dominating sets of maximal outerplanar and planar graphs
    Li, Zepeng
    Zhu, Enqiang
    Shao, Zehui
    Xu, Jin
    Discrete Applied Mathematics, 2016, 198 : 164 - 169
  • [36] The maximum Wiener index of maximal planar graphs
    Debarun Ghosh
    Ervin Győri
    Addisu Paulos
    Nika Salia
    Oscar Zamora
    Journal of Combinatorial Optimization, 2020, 40 : 1121 - 1135
  • [37] Total coloring of recursive maximal planar graphs
    Zhou, Yangyang
    Zhao, Dongyang
    Ma, Mingyuan
    Xu, Jin
    THEORETICAL COMPUTER SCIENCE, 2022, 909 : 12 - 18
  • [38] Maximal Biconnected Subgraphs of Random Planar Graphs
    Panagiotou, Konstantinos
    Steger, Angelika
    PROCEEDINGS OF THE TWENTIETH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2009, : 432 - 440
  • [39] MAXIMAL CHROMATIC POLYNOMIALS OF CONNECTED PLANAR GRAPHS
    TOMESCU, I
    JOURNAL OF GRAPH THEORY, 1990, 14 (01) : 101 - 110
  • [40] ORTHOGONAL FLOORPLANS FROM MAXIMAL PLANAR GRAPHS
    RINSMA, I
    GIFFIN, JW
    ROBINSON, DF
    ENVIRONMENT AND PLANNING B-PLANNING & DESIGN, 1990, 17 (01): : 57 - 71
12345