A short proof and a strengthening of the Whitney 2-isomorphism theorem on graphs

Discrete Mathematics

Volumn 64, Issue 1, 1987, Pages 13-25

  Kelmans, A K ^a  

^a Profsouznaya 130 3 33 117321 Moscow USSR ^*

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0042864381     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(87)90236-6     Document Type: Article

References (19)

1. On Steinitz's Theorem Concerning Convex 3-Polytopes and on Some Properties of Planar Graphs The Many Facets of Graph Theory
2. Note on isomorphism of graphs
3. A 3-skein isomorphism of graphs
4. On n-skein isomorphism of graphs
5. Graph expansion and reduction
6. The concept of a vertex in a matroid, the non-separating cycles of a graph and a new criterion for graph planarity
7. 3-skeins in a 3-connected graph
8. On existence of subgraphs of a given type in a graph
9. On edge maps of graphs preserving the subgraphs of a given type
10. On homeomorphic embedding of graphs with given properties
11. A strengthening of the Kuratowski planarity criterion for 3-connected graphs
12. Circuit preserving edge maps
13. On Whitney's 2-isomorphism theorem for graphs
14. Congruent graphs and the connectivity of graphs
15. 2-isomorphic graphs