## 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
A note on collapsible graphs and super-Eulerian graphs
β Scribed by Hao Li; Weihua Yang
- Book ID
- 113567679
- Publisher
- Elsevier Science
- Year
- 2012
- Tongue
- English
- Weight
- 205 KB
- Volume
- 312
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## 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
## dedicated to professor w. t. tutte on the occasion of his eightieth birtday It is known that the chromatic number of a graph G=(V, E) with V= [1, 2, ..., n] exceeds k iff the graph polynomial f G => ij # E, i<j (x i &x j ) lies in certain ideals. We describe a short proof of this result, using
## Abstract An application of conservative graphs to topological graph theory is indicated.
## Abstract Coset graphs are a generalization of Cayley graphs. They arise in the construction of graphs and digraphs with transitive automorphism groups. Moreover, the consideration of coset graphs makes it possible to give an algebraic description of regular connected graphs of even degree. In th