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

DOI10.1016/0012-365X(87)90236-6zbMath0613.05034OpenAlexW2021768304MaRDI QIDQ1088683

Alexander K. Kelmans

Publication date: 1987

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(87)90236-6

zbMATH Keywords

path partition2 isomorphism theoreminduced edge bijection

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph theory (05C99)

Related Items

On edge semi-isomorphisms and semi-dualities of graphs, A certain polynomial of a graph and graphs with an extremal number of trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A strengthening of the Kuratowski planarity criterion for 3-connected graphs
• On 3-skein isomorphisms of graphs
• On \(n\)-skein isomorphisms of graphs
• Circuit preserving edge maps
• On edge semi-isomorphisms and semi-dualities of graphs
• Partial matroid representations
• Concept of a vertex in a matroid and 3-connected graphs
• On Whitney's 2‐isomorphism theorem for graphs
• Note on Isomorphisms of Graphs