On 3-edge-connected supereulerian graphs in graph family \(C(l,k)\)
type: Item
instance of: scholarly article
title: On 3-edge-connected supereulerian graphs in graph family \(C(l,k)\)
zbMATH Open document ID: 1230.05189
author: Dengxin Li
author: Xiao-Min Li
author: Hong-Jian Lai
published in: Discrete Mathematics
publication date: 2010-10-11T00:00:00Z
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 5798544
zbMATH Keywords: supereulerian graphs
zbMATH Keywords: collapsible graphs
zbMATH Keywords: reduction
zbMATH Keywords: edge-cut
zbMATH Keywords: Petersen graph
MaRDI profile type: Publication
full work available at URL: j.disc.2010.05.021
OpenAlex ID: W2130910508
cites work: Q3757937
cites work: On circuits and pancyclic line graphs
cites work: The spanning subgraphs of eulerian graphs
cites work: Q5422499
cites work: A note on minimum degree conditions for supereulerian graphs
cites work: Supereulerian graphs: A survey
cites work: A reduction method to find spanning Eulerian subgraphs
cites work: Graphs without spanning closed trails
cites work: Supereulerian graphs and the Petersen graph
cites work: Super-Eulerian graphs of minimum degree at least \(4\).
cites work: Q3983243
cites work: Super-Eulerian graphs and the Petersen graph. II
cites work: Q3937450
cites work: Contractions and hamiltonian line graphs
cites work: Eulerian subgraphs and Hamilton-connected line graphs
cites work: The supereulerian graphs in the graph family \(C(l,k)\)
cites work: Supereulerianity of \(k\)-edge-connected graphs with a restriction on small bonds
cites work: A note on graphs spanned by Eulerian graphs
DOI: 10.1016/J.DISC.2010.05.021
description: scientific article; zbMATH DE number 5798544