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

DOI10.1002/jgt.3190040103zbMath0416.05032OpenAlexW1985737732MaRDI QIDQ3205248

Alexander K. 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

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

Related Items (7)

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

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