Graphs without spanning closed trails
type: Item
instance of: scholarly article
title: Graphs without spanning closed trails
zbMATH Open document ID: 0859.05060
DOI: 10.1016/S0012-365X(95)00149-Q
author: Paul A. Catlin
author: Zheng-Yiao Han
author: Hong-Jian Lai
published in: Discrete Mathematics
publication date: 1997-04-07T00:00:00Z
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 955146
zbMATH Keywords: edge-disjoint spanning trees
zbMATH Keywords: spanning closed trail
zbMATH Keywords: supereulerian
MaRDI profile type: Publication
cites work: The spanning subgraphs of eulerian graphs
cites work: Q5422499
cites work: A reduction method to find spanning Eulerian subgraphs
cites work: Q3808129
cites work: Spanning Eulerian subgraphs and matchings
cites work: Q3791179
cites work: Supereulerian graphs: A survey
cites work: Q4873803
cites work: Q3983243
cites work: A Note on Sub-Eulerian Graphs
cites work: Reduced graphs of diameter two
cites work: Decomposition of Finite Graphs Into Forests
cites work: Q3751608
Recommended article: Spanning closed trails in graphs
Recommended article: Graphs without dead ends
Recommended article: Q3985793
Recommended article: Connected graphs without long paths
Recommended article: Graphs without cycles of even length
Recommended article: Q3972099
Recommended article: Q5251896
Recommended article: Graphs without four-cycles
Recommended article: Q4405660
Recommended article: Directed Graphs Without Short Cycles
description: scientific article; zbMATH DE number 955146