Graphs with supereulerian width 3 and small diameters

DOI10.1007/S40840-024-01810-4MaRDI QIDQ6672023FDOQ6672023

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)

zbMATH Keywords

connectivityEulerian subgraphstrailscollapsible graphsMenger theoremsupereulerian width

Mathematics Subject Classification ID

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

Cites Work

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

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)