Graphs with supereulerian width 3 and small diameters
type: Item
instance of: scholarly article
title: Graphs with supereulerian width 3 and small diameters
author: Wei Xiong
author: Xing Chen
author: Yang Wu
author: Mingquan Zhan
author: Hong-Jian Lai
published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series
publication date: 2025-01-27T00:00:00Z
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 7975457
zbMATH Keywords: Eulerian subgraphs
zbMATH Keywords: trails
zbMATH Keywords: connectivity
zbMATH Keywords: Menger theorem
zbMATH Keywords: collapsible graphs
zbMATH Keywords: supereulerian width
MaRDI profile type: Publication
cites work: The spanning subgraphs of eulerian graphs
cites work: A reduction method to find spanning Eulerian subgraphs
cites work: Supereulerian graphs: A survey
cites work: Graphs without spanning closed trails
cites work: Edge-connectivity and edge-disjoint spanning trees
cites work: Super-Eulerian graphs and the Petersen graph. II
cites work: Connectivity and edge-disjoint spanning trees
cites work: A Note on Sub-Eulerian Graphs
cites work: Reduced graphs of diameter two
cites work: Hamiltonian connectedness in 3-connected line graphs
cites work: Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs
cites work: Edge-Disjoint Spanning Trees of Finite Graphs
cites work: A note on graphs spanned by Eulerian graphs
cites work: Q3898496
cites work: On the Problem of Decomposing a Graph into n Connected Factors
cites work: Polynomially determine if a graph is \((s,3)\)-supereulerian
DOI: 10.1007/S40840-024-01810-4
description: scientific article; zbMATH DE number 7975457