|
Search the dblp DataBase
Lars Døvling Andersen:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Lars Døvling Andersen, Herbert Fleischner
The NP-completeness of Finding A-trails in Eulerian Graphs and of Finding Spanning Trees in Hypergraphs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1995, v:59, n:3, pp:203-214 [Journal]
- Lars Døvling Andersen, Herbert Fleischner, Susanne Regner
Algorithms and Outerplanar Conditions for A-trails in Plane Eulerian Graphs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1998, v:85, n:2, pp:99-112 [Journal]
- Lars Døvling Andersen, André Bouchet, Bill Jackson
Orthogonal A-Trails of 4-Regular Graphs Embedded in Surfaces of Low Genus. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1996, v:66, n:2, pp:232-246 [Journal]
- Lars Døvling Andersen, Anthony J. W. Hilton
Generalized latin rectangles II: Embedding. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1980, v:31, n:3, pp:235-260 [Journal]
- Lars Døvling Andersen, Anthony J. W. Hilton
Generalized Latin rectangles I: Construction and decomposition. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1980, v:31, n:2, pp:125-152 [Journal]
- Lars Døvling Andersen, Anthony J. W. Hilton
Triangulations of 3-way regular tripartite graphs of degree 4, with applications to orthogonal latin squares. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1997, v:167, n:, pp:17-34 [Journal]
- Lars Døvling Andersen
The strong chromatic index of a cubic graph is at most 10. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1992, v:108, n:1-3, pp:231-252 [Journal]
- Lars Døvling Andersen, Preben D. Vestergaard
Graphs with all spanning trees nonisomorphic. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1996, v:155, n:1-3, pp:3-12 [Journal]
Preface. [Citation Graph (, )][DBLP]
Search in 0.014secs, Finished in 0.015secs
|