On edge semi-isomorphisms and semi-dualities of graphs

DOI10.1007/BF02986684zbMath0814.05059MaRDI QIDQ1343227

Alexander K. Kelmans

Publication date: 1 February 1995

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

Whitney's 2-isomorphism theoremedge semi-isomorphismssemi-dualitiesWhitney's planarity criterion

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial aspects of matroids and geometric lattices (05B35) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

A short proof and a strengthening of the Whitney 2-isomorphism theorem on graphs, Tension continuous maps -- their structure and applications, On graphs uniquely defined by their \(K\)-circular matroids, \(k\)-circular matroids of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On 3-skein isomorphisms of graphs
• A short proof and a strengthening of the Whitney 2-isomorphism theorem on graphs
• On \(n\)-skein isomorphisms of graphs
• Circuit preserving edge maps
• Generating the triangulations of the projective plane
• Concept of a vertex in a matroid and 3-connected graphs
• On Whitney's 2‐isomorphism theorem for graphs
• Note on Isomorphisms of Graphs