Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Andersen, Lars D{\o}vling"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Optimal acyclic edge-coloring of cubic graphs
Lars Dvling Andersen
,
Edita Mác̑ajová
,
Ján Mazák
Journal of Graph Theory
71
(4), 2012, pp. 353-364
Largest non-unique subgraphs
Lars Dvling Andersen
,
Preben Dahl Vestergaard
,
Zsott Tuza
Graphs and Combinatorics
22
(4), 2006, pp. 453-470
Algorithms and outerplanar conditions for A-trails in plane Eulerian graphs
Lars Dvling Andersen
,
Herbert Fleischner
,
Sussanne Regner
Discrete Applied Mathematics
85
(2), 1998, pp. 99-112
The NP-completeness of finding
A
-trails in Eulerian graphs and of finding spanning trees in hypergraphs
Lars Dvling Andersen
,
Herbert Fleischner
Discrete Applied Mathematics
59
, 1995, pp. 203-214
Edge orbits and edge-deleted subgraphs
Lars Dvling Andersen
,
Songkang Ding
,
Gert Sabidussi
,
Preben Dahl Vestergaard
Graphs and Combinatorics
8
, 1992, pp. 31-44
Removable edges in cyclically 4-edge-connected cubic graphs
Lars Dvling Andersen
,
Herbert Fleischner
,
Bill Jackson
Graphs and Combinatorics
4
, 1988, pp. 1-21