On the reconstruction of planar graphs

被引：5
|
作者：
Bilinski, Mark
Kwon, Young Soo
Yu, Xingxing [1 ]
机构：
[1] Georgia Inst Technol, Sch Math, Atlanta, GA 30332 USA
[2] Yeungnam Univ, Dept Math, Kyongsan 712749, South Korea
[3] Nankai Univ, Ctr Combinator, LPMC, Tianjin 300071, Peoples R China
来源：
JOURNAL OF COMBINATORIAL THEORY SERIES B | 2007年 / 97卷 / 05期
基金：
美国国家科学基金会; 中国国家自然科学基金;
关键词：
reconstruction; recognition; planar graph; non-separating cycle; wheel neighborhood;
D O I：
10.1016/j.jctb.2006.12.005
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We show that the planarity of a graph can be recognized from its vertex deleted subgraphs, which answers a question posed by Bondy and Hemminger in 1979. We also state some useful counting lemmas and use them to reconstruct certain planar graphs. (c) 2007 Elsevier Inc. All rights reserved.
引用
收藏
页码：745 / 756
页数：12
相关论文
共 50 条
12345