Fan-type conditions for spanning Eulerian subgraphs
type: Item
instance of: scholarly article
title: Fan-type conditions for spanning Eulerian subgraphs
zbMATH Open document ID: 1327.05239
author: Wei-Guo Chen
author: Zhi-Hong Chen
published in: Graphs and Combinatorics
publication date: 2015-12-17T00:00:00Z
Mathematics Subject Classification ID: 05C60
Mathematics Subject Classification ID: 05C12
zbMATH DE Number: 6521763
zbMATH Keywords: spanning Eulerian subgraphs
zbMATH Keywords: reduction method
zbMATH Keywords: Fan-type condition
MaRDI profile type: Publication
full work available at URL: s00373-014-1511-4
OpenAlex ID: W2132309220
cites work: Q3097395
cites work: A reduction method to find spanning Eulerian subgraphs
cites work: Q3791179
cites work: Contractions of graphs with no spanning Eulerian subgraphs
cites work: Graphs without spanning closed trails
cites work: A degree condition for spanning eulerian subgraphs
cites work: Supereulerian graphs, independent sets, and degree-sum conditions
cites work: Fan-type conditions for collapsible graphs
cites work: Q3983243
cites work: Q5740779
cites work: Lai's conditions for spanning and dominating closed trails
cites work: Properties of Catlin's reduced graphs and supereulerian graphs
cites work: Collapsible graphs and matchings
cites work: New sufficient conditions for cycles in graphs
cites work: Eulerian subgraphs containing given vertices and hamiltonian line graphs
cites work: On Spanning and Dominating Circuits in Graphs
cites work: Supereulerian graphs and the Petersen graph
cites work: A note on graphs spanned by Eulerian graphs
cites work: On dominating and spanning circuits in graphs
DOI: 10.1007/S00373-014-1511-4
description: scientific article; zbMATH DE number 6521763