Removing circuits in 3-connected binary matroids
type: Item
instance of: scholarly article
title: Removing circuits in 3-connected binary matroids
zbMATH Open document ID: 1169.05012
author: Raul Cordovil
author: Bráulio Maia Junior
author: Manoel Lemos
published in: Discrete Mathematics
publication date: 2009-04-09T00:00:00Z
Mathematics Subject Classification ID: 05B35
zbMATH DE Number: 5542362
zbMATH Keywords: matroid
zbMATH Keywords: binary matroid
zbMATH Keywords: 3-connected matroid
zbMATH Keywords: circuit
zbMATH Keywords: removable circuit
MaRDI profile type: Publication
full work available at URL: j.disc.2007.12.095
OpenAlex ID: W2135952967
cites work: Q3909066
cites work: The 3-connected binary matroids with circumference 6 or 7
cites work: Removable Cycles in Planar Graphs
cites work: Removable circuits in multigraphs
cites work: Removable Circuits in Binary Matroids
cites work: Removable Cycles in 2-Connected Graphs of Minimum Degree at Least Four
cites work: Connected matroids with a small circumference
cites work: Q3447285
cites work: Q3956975
cites work: A new planarity criterion for 3-connected graphs
cites work: Q4273876
cites work: Non-separating cocircuits in binary matroids
cites work: On removable circuits in graphs and matroids
cites work: On the 3-connected matroids that are minimal having a fixed spanning restriction
cites work: On size, circumference and circuit removal in 3-connected matroids
cites work: Kreuzungsfreie a,b-Wege in endlichen Graphen
cites work: Contractible bonds in graphs
cites work: On the interplay between graphs and matroids
cites work: Q3135082
cites work: On minimally 3-connected binary matroids
cites work: On removable even circuits in graphs
cites work: Decomposition of regular matroids
cites work: Non-separating induced cycles in graphs
cites work: How to Draw a Graph
DOI: 10.1016/J.DISC.2007.12.095
description: scientific article; zbMATH DE number 5542362