The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphs

Authors:
Lars Døvling Andersen;Herbert Fleischner
Affiliations:
-;-
Venue:
Discrete Applied Mathematics
Year:
1995

Citing 0
Cited 2

Plane graphs with Eulerian Petrie walks

Discrete Mathematics - Algebraic and topological methods in graph theory
The complexity of counting eulerian tours in 4-regular graphs

LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics

Quantified Score

Hi-index	0.04

Visualization

Abstract