The 3-connected graphs with exactly \(k\) non-essential edges
type: Item
instance of: scholarly article
title: The 3-connected graphs with exactly \(k\) non-essential edges
zbMATH Open document ID: 1231.05159
author: Yuxing Liu
published in: Graphs and Combinatorics
publication date: 2010-11-12T00:00:00Z
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 5815411
zbMATH Keywords: 3-connected graph
zbMATH Keywords: non-essential edge
zbMATH Keywords: Fan
zbMATH Keywords: wheel
MaRDI profile type: Publication
full work available at URL: s00373-010-0873-5
OpenAlex ID: W2056643032
cites work: Q3284374
cites work: On the structure of 3-connected matroids and graphs
cites work: The 3-connected graphs with exactly three non-essential edges
cites work: Q5422997
DOI: 10.1007/S00373-010-0873-5
description: scientific article; zbMATH DE number 5815411