Spanning Eulerian subgraphs of large size
type: Item
instance of: scholarly article
title: Spanning Eulerian subgraphs of large size
zbMATH Open document ID: 1407.05139
author: Nastaran Haghparast
author: Dariush Kiani
published in: Graphs and Combinatorics
publication date: 2019-03-21T00:00:00Z
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C12
zbMATH DE Number: 7040465
zbMATH Keywords: 5-regular graph
zbMATH Keywords: supereulerian
zbMATH Keywords: Eulerian subgraph
zbMATH Keywords: large size
zbMATH Keywords: claw-free
MaRDI profile type: Publication
full work available at URL: s00373-018-1992-7
OpenAlex ID: W2903099632
cites work: Tight bounds on maximal and maximum matchings
cites work: Q3097395
cites work: Even factors of graphs
cites work: On maximum number of edges in a spanning eulerian subgraph
cites work: A note on graphs spanned by Eulerian graphs
Wikidata QID: Q128894885
DOI: 10.1007/S00373-018-1992-7
Recommended article: On finding spanning eulerian subgraphs
Recommended article: Spanning Eulerian subgraphs and matchings
Recommended article: Q3808129
Recommended article: Spanning subgraph with Eulerian components
Recommended article: Q3812277
Recommended article: Spanning Eulerian subgraphs of bounded degree in triangulations
Recommended article: Spanning Eulerian subgraphs of 2-edge-connected graphs
Recommended article: Spanning eulerian subdigraphs in semicomplete digraphs
Recommended article: Spanning eulerian subgraphs, the splitting lemma, and Petersen's theorem
Recommended article: Expander spanning subgraphs with large girth
description: scientific article; zbMATH DE number 7040465