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
[3]
Hilfe
Suche: Author="Broersma, H.J."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Toughness and vertex degrees
D. Bauer
,
H.J. Broersma
,
J. van den Heuvel
,
N. Kahl
,
E. Schmeichel
Journal of Graph Theory
72
(2), 2013, pp. 209-219
Tank-ring factors in supereulerian claw-free graphs
MingChu Li
,
Lifeng Yuan
,
He Jiang
,
Bing Liu
,
H.J. Broersma
Graphs and Combinatorics
29
(3), 2013, pp. 599-608
Degree sequences and the existence of
k
-factors
D. Bauer
,
H.J. Broersma
,
J. van den Heuvel
,
N. Kahl
,
E. Schmeichel
Graphs and Combinatorics
28
(2), 2012, pp. 149-166
How many conjectures can you stand? A survey
H.J. Broersma
,
Z. Ryjác̑ek
,
P. Vrána
Graphs and Combinatorics
28
(1), 2012, pp. 57-75
Tutte sets in graphs I: Maximal Tutte sets and
D
-graphs
D. Bauer
,
H.J. Broersma
,
A. Morgana
,
E. Schmeichel
Journal of Graph Theory
55
(4), 2007, pp. 343-358
A new upper bound on the cyclic chromatic number
O.V. Borodin
,
H.J. Broersma
,
A. Glebov
,
J. van den Heuvel
Journal of Graph Theory
54
(1), 2007, pp. 58-72
On-line coloring of
H
-free bipartite graphs
H.J. Broersma
,
A. Capponi
,
D. Paulusma
Lecture Notes in Computer Science
3998
, 2006, pp. 284-295
A generalization of AT-free graphs and a generic algorithm for solving triangulaiton problems
H.J. Broersma
,
T. Kloks
,
D. Kratsch
,
H. Müller
Algorithmica
32
(4), 2002, pp. 594-610
On factors of 4-connected claw-free graphs
H.J. Broersma
,
M. Kriesell
,
Z. Ryjác̑ek
Journal of Graph Theory
(2), 2001, pp. 125-136
Not every 2-tough graph is Hamiltonian
D. Bauer
,
H.J. Broersma
,
H.J. Veldman
Discrete Applied Mathematics
99
(1-3), 2000, pp. 317-321
A linear time algorith for minimum fill-in and treewidth for distance hereditary graphs
H.J. Broersma
,
E. Dahlhaus
,
T. Kloks
Discrete Applied Mathematics
99
(1-3), 2000, pp. 367-400
Algorithms for the treewidth and minimum fill-in of HHD-free graphs
H.J. Broersma
,
E. Dahlhaus
,
T. Kloks
Lecture Notes in Computer Science
1335
, 1997, pp. 109-117
On graphs satisfying a local ore-type condition
A.S. Asratian
,
H.J. Broersma
,
J. van den Heuvel
,
H.J. Veldman
Journal of Graph Theory
21
(1), 1996, pp. 1-10
Toughness and longest cycles in 2-connected planar graphs
T. Böhme
,
H.J. Broersma
,
H.J. Veldmann
Journal of Graph Theory
23
(3), 1996, pp. 257-263
Hamiltonicity of regular 2-connected graphs
H.J. Broersma
,
J. van den Heuvel
,
B. Jackson
,
H.J. Veldman
Journal of Graph Theory
22
(2), 1996, pp. 105-124
Toughness and Hamiltonicity in almost claw-free graphs
H.J. Broersma
,
Z. Ryjác̑ek
,
I. Schiermeyer
Journal of Graph Theory
21
(4), 1996, pp. 431-439
Bipartite regular graphs with fixed diameter
H.J. Broersma
,
F. Göbel
Networks
26
(3), 1995, pp. 139-144
Cycles through particular subgraphs of claw-free graphs
H.J. Broersma
,
M. Lu
Journal of Graph Theory
20
(4), 1995, pp. 459-465
On Hamiltonian properties of 2-tough graphs
D. Bauer
,
H.J. Broersma
,
J. van den Heuvel
,
H.J. Veldman
Journal of Graph Theory
18
(6), 1994, pp. 539-543
Subgraphs, closures and hamiltonicity
H.J. Broersma
,
I. Schiermeyer
Discrete Applied Mathematics
51
(1-2), 1994, pp. 39-46
Generating all 3-connected 4-regular planar graphs from the Octahedron graph
H.J. Broersma
,
A.J.W. Duijvestijn
,
F. Göbel
Journal of Graph Theory
17
(5), 1993, pp. 613-620
Decomposition of bipartite graphs under degree constraints
H.J. Broersma
,
R.J. Faudree
,
J. van den Heuvel
,
H.J. Veldman
Networks
23
(3), 1993, pp. 159-164
Coloring a graph optimally with two colors
H.J. Broersma
,
F. Göbel
Discrete Mathematics
118
(1-3), 1993, pp. 23-31
Long paths and cycles in tough graphs
H.J. Broersma
,
J. van den Heuvel
,
H.A. Jung
,
H.J. Veldman
Graphs and Combinatorics
9
, 1993, pp. 3-17
Cycles containing all vertices of maximum degree
H.J. Broersma
,
J. van den Heuvel
,
H.A. Jung
,
H.J. Veldman
Journal of Graph Theory
17
(3), 1993, pp. 373-385
Seiten 1
2
>