Concept of a vertex in a matroid and 3-connected graphs

DOI10.1002/JGT.3190040103MaRDI QIDQ3205248zbMATH OpenOpenAlexFDO

Authors Alexander Kelmans

Publication date 1980

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190040103

zbMATH Keywords

cycleisomorphismplanargraph planaritymatroid of a 3-connected graphmatroid vertexnon- separating

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial aspects of matroids and geometric lattices (05B35) Paths and cycles (05C38) Graph theory (05C99)

Cited in

(7)

• Planarity and duality of finite and infinite graphs
• On edge semi-isomorphisms and semi-dualities of graphs
• Nonseparating Cocircuits in Binary Matroids
• Adjacency, inseparability, and base orderability in matroids
• A short proof and a strengthening of the Whitney 2-isomorphism theorem on graphs
• The theorem on planar graphs
• Non-separating induced cycles in graphs

This page was built for publication: Concept of a vertex in a matroid and 3-connected graphs

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