Spanning Eulerian subgraphs of large size

DOI10.1007/S00373-018-1992-7zbMATH Open1407.05139OpenAlexW2903099632WikidataQ128894885 ScholiaQ128894885MaRDI QIDQ1733865FDOQ1733865

Authors: 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

Recommendations

• On finding spanning eulerian subgraphs
• Spanning Eulerian subgraphs and matchings
• scientific article; zbMATH DE number 4077283
• Spanning subgraph with Eulerian components
• scientific article; zbMATH DE number 4081604
• Spanning Eulerian subgraphs of bounded degree in triangulations
• Spanning Eulerian subgraphs of 2-edge-connected graphs
• Spanning eulerian subdigraphs in semicomplete digraphs
• Spanning eulerian subgraphs, the splitting lemma, and Petersen's theorem
• Expander spanning subgraphs with large girth

zbMATH Keywords

claw-freeEulerian subgraphsupereulerian5-regular graphlarge size

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• Spanning Eulerian subgraphs in claw-free graphs
• Spanning eulerian subgraphs, the splitting lemma, and Petersen's theorem
• On maximum number of edges in a spanning eulerian subgraph
• Title not available (Why is that?)
• A note on spanning Eulerian graphs.

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

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