2-walks in 3-connected planar graphs (vol 11, pg 117, 1995)

被引：0
|
作者：
Gao, Zhicheng [1 ]
Richter, R. Bruce [2 ]
Yu, Xingxing [3 ]
机构：
[1] Carleton Univ, Ottawa, ON, Canada
[2] Univ Waterloo, Waterloo, ON, Canada
[3] Georgia Inst Technol, Atlanta, GA 30332 USA
来源：
AUSTRALASIAN JOURNAL OF COMBINATORICS | 2006年 / 36卷
关键词：
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
An error in the proof of the main theorem of our earlier paper in Australas. J. Combin. 11 (1995), 117-122, was pointed out by Henning Bruhn. We correct this error.
引用
收藏
页码：315 / 316
页数：2
相关论文
共 50 条
  • [21] STRICTLY CONVEX DRAWINGS OF 3-CONNECTED PLANAR GRAPHS
    Bekos, Michael A.
    Gronemann, Martin
    Montecchiani, Fabrizio
    Symvonis, Antonios
    JOURNAL OF COMPUTATIONAL GEOMETRY, 2024, 15 (01) : 1 - 20
  • [22] SYMMETRIES OF 3-REGULAR 3-CONNECTED PLANAR GRAPHS
    MOORE, EF
    NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1973, 20 (03): : A400 - A400
  • [23] Connected subgraphs with small degree sums in 3-connected planar graphs
    Enomoto, H
    Ota, K
    JOURNAL OF GRAPH THEORY, 1999, 30 (03) : 191 - 203
  • [24] Strictly-Convex Drawings of 3-Connected Planar Graphs
    Bekos, Michael A.
    Gronemann, Martin
    Montecchiani, Fabrizio
    Symvonis, Antonios
    GRAPH DRAWING AND NETWORK VISUALIZATION, GD 2022, 2023, 13764 : 144 - 156
  • [25] Subgraphs with restricted degrees of their vertices in planar 3-connected graphs
    Fabrici, I
    Jendrol, S
    GRAPHS AND COMBINATORICS, 1997, 13 (03) : 245 - 250
  • [26] The isomorphism problem for planar 3-connected graphs is in unambiguous logspace
    Thierauf, Thomas
    Wagner, Fabian
    STACS 2008: PROCEEDINGS OF THE 25TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 2008, : 633 - 644
  • [27] A counterexample to prism-hamiltonicity of 3-connected planar graphs
    Spacapan, Simon
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2021, 146 : 364 - 371
  • [28] Subgraphs with Restricted Degrees of Their Vertices in Planar 3-Connected Graphs
    Igor Fabrici
    Stanislav Jendrol
    Graphs and Combinatorics, 1997, 13 : 245 - 250
  • [29] The Isomorphism Problem for Planar 3-Connected Graphs Is in Unambiguous Logspace
    Thierauf, Thomas
    Wagner, Fabian
    THEORY OF COMPUTING SYSTEMS, 2010, 47 (03) : 655 - 673
  • [30] HAMILTONIAN CYCLES IN CUBIC 3-CONNECTED BIPARTITE PLANAR GRAPHS
    HOLTON, DA
    MANVEL, B
    MCKAY, BD
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1985, 38 (03) : 279 - 297
12345