Spanning Eulerian subgraphs of large size

DOI10.1007/S00373-018-1992-7zbMath1407.05139OpenAlexW2903099632WikidataQ128894885 ScholiaQ128894885MaRDI QIDQ1733865

Nastaran Haghparast, Dariush Kiani

Publication date: 21 March 2019

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-018-1992-7

zbMATH Keywords

Eulerian subgraphclaw-freesupereulerian5-regular graphlarge size

Mathematics Subject Classification ID

Distance in graphs (05C12) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• On maximum number of edges in a spanning eulerian subgraph
• Tight bounds on maximal and maximum matchings
• Even factors of graphs
• A note on graphs spanned by Eulerian graphs

This page was built for publication: Spanning Eulerian subgraphs of large size