## Abstract We show that the problem raised by Boesch, Suffel, and Tindell of determining whether or not a graph is spanned by an Eulerian subgraph is NPβcomplete. We also note that there does exist a good algorithm for determining if a graph is spanned by a subgraph having positive even degree at
β¦ LIBER β¦
On minimal Eulerian graphs
β Scribed by Christos H. Papadimitriou; Mihalis Yannakakis
- Book ID
- 113162367
- Publisher
- Elsevier Science
- Year
- 1981
- Tongue
- English
- Weight
- 569 KB
- Volume
- 12
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A note on graphs spanned by Eulerian gra
β
W. R. Pulleyblank
π
Article
π
1979
π
John Wiley and Sons
π
English
β 109 KB
π 1 views
On minimal graphs
β
W.D. Fellner
π
Article
π
1982
π
Elsevier Science
π
English
β 750 KB
A Note on Sub-Eulerian Graphs
β
F. Jaeger
π
Article
π
1979
π
John Wiley and Sons
π
English
β 114 KB
## Abstract We present an algebraic proof of the following result: a set of edges of a multigraph __G__ is contained in some cycle of __G__ iff the set contains no odd cocycle of __G__ (βcycleβ means here: edge disjoint sum of elementary cycles). As a corollary we obtain the characterization of sub
A note on collapsible graphs and super-E
β
Hao Li; Weihua Yang
π
Article
π
2012
π
Elsevier Science
π
English
β 205 KB
On minimal Folkman graphs
β
Tomasz Εuczak; Andrzej RuciΕski; Sebastian UrbaΕski
π
Article
π
2001
π
Elsevier Science
π
English
β 170 KB
On Ramsey Minimal Graphs
β
RΓΆdl, V.; Siggers, M.
π
Article
π
2008
π
Society for Industrial and Applied Mathematics
π
English
β 305 KB