Essentially 3-edge-connected reduced graph of diameter three

DOI10.1016/J.AMC.2026.130107MaRDI QIDQ7325003zbMATH OpenFDO

Authors Fulong Ye, Xiaoxiao Qin, Mingquan Zhan, Bofeng Huo

Publication date 4 September 2026

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.AMC.2026.130107

Mathematics Subject Classification ID

Combinatorics (05-XX) Graph theory (05Cxx)

Cites work

• A note on graphs spanned by Eulerian graphs
• A Note on Sub-Eulerian Graphs
• A reduction method to find spanning Eulerian subgraphs
• Catlin's reduced graphs with small orders
• Edge-Disjoint Spanning Trees of Finite Graphs
• Graph theory
• Graphs without spanning closed trails
• scientific article; zbMATH DE number 975339 (Why is no real title available?)
• On hamiltonian line graphs and connectivity
• On the Problem of Decomposing a Graph into n Connected Factors
• Reduced graphs of diameter two
• Research problems from the 5th Slovenian Conference (Bled, 2003)
• Super-Eulerian graphs and the Petersen graph. II
• Supereulerian graphs and the Petersen graph
• Supereulerian graphs: A survey
• The spanning subgraphs of eulerian graphs

This page was built for publication: Essentially 3-edge-connected reduced graph of diameter three

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