On removable even circuits in graphs
type: Item
instance of: scholarly article
title: On removable even circuits in graphs
zbMATH Open document ID: 1053.05074
author: Philip Sinclair
published in: Discrete Mathematics
publication date: 2004-11-22T00:00:00Z
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 2117307
zbMATH Keywords: Removable even circuits
MaRDI profile type: Publication
full work available at URL: j.disc.2004.03.012
OpenAlex ID: W2033981405
cites work: Q3097395
cites work: Removable Cycles in Planar Graphs
cites work: Removable circuits in multigraphs
cites work: Removable Cycles in 2-Connected Graphs of Minimum Degree at Least Four
cites work: On removable circuits in graphs and matroids
cites work: Kreuzungsfreie a,b-Wege in endlichen Graphen
cites work: Non-separating induced cycles in graphs
cites work: Q3216652
DOI: 10.1016/J.DISC.2004.03.012
description: scientific article; zbMATH DE number 2117307