Title
A reduction criterion for supereulerian graphs
Abstract
Let G be a graph, and let H be a connected subgraph of G. When it is known that the graph G/H (obtained from G by contracting H to a vertex) has a spanning eulerian subgraph, under what conditions can it be inferred that G itself has a spanning eulerian subgraph? (C) 1996 John Wiley & Sons, Inc.
Year
DOI
Venue
1996
10.1002/(SICI)1097-0118(199606)22:2<151::AID-JGT5>3.0.CO;2-M
Journal of Graph Theory
Field
DocType
Volume
Discrete mathematics,Combinatorics,Forbidden graph characterization,Reduction criterion,Cycle basis,Induced subgraph isomorphism problem,Distance-hereditary graph,Universal graph,Subgraph isomorphism problem,Degeneracy (graph theory),Mathematics
Journal
22
Issue
ISSN
Citations 
2
0364-9024
0
PageRank 
References 
Authors
0.34
0
1
Name
Order
Citations
PageRank
Paul A. Catlin151466.29