Graphs with supereulerian width 3 and small diameters

DOI10.1007/S40840-024-01810-4MaRDI QIDQ6672023zbMATH OpenFDO

Authors Wei Xiong, Xing Chen, Yang Wu, Mingquan Zhan, Hong-Jian Lai

Publication date 27 January 2025

Published in Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S40840-024-01810-4

zbMATH Keywords

collapsible graphsconnectivityEulerian subgraphsMenger theoremsupereulerian widthtrails

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Cites work

• A note on graphs spanned by Eulerian graphs
• A Note on Sub-Eulerian Graphs
• A reduction method to find spanning Eulerian subgraphs
• Connectivity and edge-disjoint spanning trees
• Edge-connectivity and edge-disjoint spanning trees
• Edge-Disjoint Spanning Trees of Finite Graphs
• Graphs without spanning closed trails
• Hamiltonian connectedness in 3-connected line graphs
• scientific article; zbMATH DE number 3706451 (Why is no real title available?)
• On the Problem of Decomposing a Graph into n Connected Factors
• Polynomially determine if a graph is \((s,3)\)-supereulerian
• Reduced graphs of diameter two
• Super-Eulerian graphs and the Petersen graph. II
• Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs
• Supereulerian graphs: A survey
• The spanning subgraphs of eulerian graphs

This page was built for publication: Graphs with supereulerian width 3 and small diameters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6672023)