SCOPUS 정보 검색 플랫폼

Volumn 46, Issue 3, 2004, Pages 183-206

On possible counterexamples to Negami's planar cover conjecture

Author keywords

Graph; Minor; Planar cover; Projective plane

Indexed keywords

MAPPING; MAPS; SET THEORY; THEOREM PROVING;

INFINITE TREES; MINOR; PLANAR COVER; PROJECTIVE PLANE;

TREES (MATHEMATICS);

EID: 3042662504 PISSN: 03649024 EISSN: None Source Type: Journal
DOI: 10.1002/jgt.10177 Document Type: Article

Times cited : (12)

References (15)

1
- 0000629168
- A Kuratowski theorem for the protective plane
- D. Archdeacon, A Kuratowski theorem for the protective plane, J Graph Theory 5 (1981), 243-246.
- (1981) J Graph Theory , vol.5 , pp. 243-246
- Archdeacon, D.¹

2
- 0036904483
- Two graphs without planar covers
- D. Archdeacon, Two graphs without planar covers, J Graph Theory 41 (2002), 318-326.
- (2002) J Graph Theory , vol.41 , pp. 318-326
- Archdeacon, D.¹

3
- 0000133557
- 103 Graphs that are irreducible for the projective plane
- H. Glover, J. P. Huneke, and C. S. Wang, 103 Graphs that are irreducible for the projective plane, J Combin Theory Ser B 27 (1979), 332-370.
- (1979) J Combin Theory Ser B , vol.27 , pp. 332-370
- Glover, H.¹ Huneke, J.P.² Wang, C.S.³

4
- 0345884836
- 4,4 - E has no finite planar cover
- 4,4 - e has no finite planar cover, J Graph Theory 27 (1998), 51-60.
- (1998) J Graph Theory , vol.27 , pp. 51-60
- Hliněný, P.¹

5
- 0042279741
- A note on possible extensions of Negami's conjecture
- P. Hliněný, A note on possible extensions of Negami's conjecture, J Graph Theory 32 (1999), 234-240.
- (1999) J Graph Theory , vol.32 , pp. 234-240
- Hliněný, P.¹

6
- 25344450062
- Ph.D. Dissertation, Georgia Institute of Technology
- P. Hliněný, Planar Covers of Graphs: Negami's Conjecture, Ph.D. Dissertation, Georgia Institute of Technology, 1999.
- (1999) Planar Covers of Graphs: Negami's Conjecture
- Hliněný, P.¹

7
- 31244435207
- Another two graphs having no planar covers
- P. Hliněný, Another two graphs having no planar covers, J Graph Theory 37 (2001), 227-242.
- (2001) J Graph Theory , vol.37 , pp. 227-242
- Hliněný, P.¹

8
- 0036260735
- Generating internally four-connected graphs
- T. Johnson and R. Thomas, Generating internally four-connected graphs, J Combin Theory Ser B 85 (2002), 21-58.
- (2002) J Combin Theory Ser B , vol.85 , pp. 21-58
- Johnson, T.¹ Thomas, R.²

9
- 38249032836
- The spherical genus and virtually planar graphs
- S. Negami, The spherical genus and virtually planar graphs, Discrete Math 70 (1988), 159-168.
- (1988) Discrete Math , vol.70 , pp. 159-168
- Negami, S.¹

10
- 0041443699
- Graphs which have no finite planar covering
- S. Negami, Graphs which have no finite planar covering, Bull Inst Math Acad Sinica 16 (1988), 378-384.
- (1988) Bull Inst Math Acad Sinica , vol.16 , pp. 378-384
- Negami, S.¹

11
- 38249018755
- Graph minors IX, Disjoint crossed paths
- N. Robertson and P. D. Seymour, Graph minors IX, Disjoint crossed paths, J Combin Theory Ser B 49 (1990), 40-77.
- (1990) J Combin Theory Ser B , vol.49 , pp. 40-77
- Robertson, N.¹ Seymour, P.D.²

13
- 0001084179
- Disjoint paths in graphs
- P. D. Seymour, Disjoint paths in graphs, Discrete Math 29 (1980), 293-309.
- (1980) Discrete Math , vol.29 , pp. 293-309
- Seymour, P.D.¹

14
- 84976816483
- A polynomial solution to the undirected two paths problem
- Y. Shiloach, A polynomial solution to the undirected two paths problem, J Assoc Comput Math 27 (1980), 445-456.
- (1980) J Assoc Comput Math , vol.27 , pp. 445-456
- Shiloach, Y.¹

15
- 0000648981
- 2-linked graphs
- C. Thomassen, 2-linked graphs, Eur J Combin 1 (1980), 371-378.
- (1980) Eur J Combin , vol.1 , pp. 371-378
- Thomassen, C.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.