Prime vertex-minors of a prime graph

DOI10.1016/j.ejc.2023.103871arXiv2202.07877OpenAlexW4388749820MaRDI QIDQ6201871

Donggyu Kim, Sang-il Oum

Publication date: 26 March 2024

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2202.07877

zbMATH Keywords

cycle graphpivot-minors

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Combinatorial aspects of matroids and geometric lattices (05B35) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Isotropic systems
• Graphic presentations of isotropic systems
• Reducing prime graphs and recognizing circle graphs
• On the connectivity function of a matroid
• An efficient algorithm to recognize locally equivalent graphs
• Circle graph obstructions
• Minimally 3-connected isotropic systems
• Matroids and graphs with few non-essential elements
• On the structure of 3-connected matroids and graphs
• The 3-connected graphs with exactly three non-essential edges
• Rank-width and vertex-minors
• Rank-Width and Well-Quasi-Ordering
• Circle graph obstructions under pivoting
• Connectivity in Matroids
• Graph-Theoretic Concepts in Computer Science

This page was built for publication: Prime vertex-minors of a prime graph