2-isomorphic graphs.

DOI10.2307/2371127MaRDI QIDQ559379zbMATH OpenOpenAlexWikidataFDO

Authors Hassler Whitney

Publication date 1933

Published in American Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2371127

Cited in

(16)

• scientific article; zbMATH DE number 4101266 (Why is no real title available?)
• Large matchings in maximal 1-planar graphs
• Proper edge colorings of planar graphs with rainbow \(C_4\)-s
• Note on robust coloring of planar graphs
• Rigidity and reconstruction in matroids of highly connected graphs
• Chromatically equivalent chordal graphs
• Planar cycle-extendable graphs
• Line graph embedding of co-intersection graph of ideals of commutative rings
• A note on the structure of locally finite planar quasi-transitive graphs
• Polyhedra with hexagonal and triangular faces and three faces around each vertex
• K₄-free planar minimal bricks with the maximum number of edges
• Relating code equivalence to other isomorphism problems
• Automorphisms and isomorphisms of maps in linear time
• Quantum automorphisms of matroids
• Automorphisms and isomorphisms of maps in linear time
• On proximity and other distance parameters in planar graphs

This page was built for publication: 2-isomorphic graphs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q559379)