Broersma, Haitze Jouke (1958-)
wiskundige (promoveerde in 1988, TU Twente (Eschede))
| rdfs:label | "Broersma, Haitze Jouke (1958-)" |
| schema:name | "Haitze Jouke Broersma" |
|
schema:family |
"Broersma" |
|
schema:given |
"Haitze Jouke" |
|
schema:alternate |
"Broersma, Hajo" |
| schema:description | "wiskundige (promoveerde in 1988, TU Twente (Eschede))" |
|
schema:birth |
"1958" |
|
schema:same |
<http:/ |
|
<https:/ |
|
| wd:Q102278551 | |
|
schema:main |
<https:/ |
Inverse relations
[ .. ] → schema:author → Broersma, Haitze Jouke (1958-)
A closure concept based on degree-sums of independent triples / H.J. Broersma and I. Schiermeyerschema:ProductModel
A generalization of Ore's theorem involving neighborhood unions / H.J. Broersma, J. van den Heuvel, H.J. Veldmanschema:ProductModel
A note on "the matching polynomial of a polygraph" / H.J. Broersma and Xueliang Lischema:ProductModel
A note on K4-closures in Hamiltonian graph theory / H.J. Broersmaschema:ProductModel
A note on the minimum size of a vertex pancyclic graph / H.J. Broersmaschema:ProductModel
A ơ3 type condition for heavy cycles in weighted graphs / H.J. Broersma, S. Zhang and X. Lischema:ProductModel
Algorithms for the treewidth and minimum fill-in of HHD-free graphs / H.J. Broersma, E. Dahlhaus and T. Kloksschema:ProductModel
Bipartite regular graphs with fixed diameter / H.J. Broersma and F. Göbelschema:ProductModel
Coloring a graph optimally with two colors / H.J. Broersma, F. Göbelschema:ProductModel
Cycles through particular subgraphs of claw-free graphs / H.J. Broersma, M. Luschema:ProductModel
Dirac's minimum degree condition restricted to claws / H.J. Broersma, Z. Ryjáček and I. Schiermeyerschema:ProductModel
Directed path graphs / H.J. Broersma and X. Lischema:ProductModel
Existence of Delta index lambda-cycles and Delta index lambda-paths / H.J. Broersmaschema:ProductModel
Generating all 3-connected 4-regular planar graphs from the Octahedron graph / H.J. Broersma, A.J.W. Duijvestijn and F. Göbelschema:ProductModel
Grafen in de praktijk / Hajo Broersmaschema:ProductModel
Grafen in de praktijk / Hajo Broersma ; [eindred.: Carolien Reus]schema:ProductModel
Hamilton cycles in graphs and related topics / Haitze Jouke Broersmaschema:ProductModel
Independence trees and Hamilton cycles / H.J. Broersma and H. Tuinstraschema:ProductModel
Isomorphisms and traversability of directed path graphs / H.J. Broersma and X. Lischema:ProductModel
Isomorphisms and traversability of directed path graphs / H.J. Broersma and X. Lischema:ProductModel
... show all 48
[ .. ] → schema:contributor → Broersma, Haitze Jouke (1958-)
A fan type condition for heavy cycles in weighted graphs / H.J. Broersma ... [et al.]schema:ProductModel
A generalization of AT-free graphs and a generic algorithm for solving triangulation problems / H.J. Broersma ... [et al.]schema:ProductModel
A note on a conjecture concerning tree-partitioning 3-regular graphs / T. Böhme, H.J. Broersma and H. Tuinstraschema:ProductModel
A note on a conjecture concerning tree-partitioning 3-regular graphs / T. Böhme, H.J. Broersma and H. Tuinstraschema:ProductModel
Around three lemmas in Hamiltonian graph theory / D. Bauer, H.J. Broersma, H.J. Veldmanschema:ProductModel
Contributions to the Twente Workshop on Hamiltonian graph theory, April 6-10, 1992 / H.J. Broersma, J. van den Heuvel, H.J. Veldman (eds.)schema:ProductModel
Cycles containing all vertices of maximum degree / H.J. Broersma ... [et al.]schema:ProductModel
Cycles through subsets with large degree sums / H.J. Broersma ... [et al.]schema:ProductModel
Decomposition of bipartite graphs under degree constraints / H.J. Broersma ... [et al.]schema:ProductModel
Directed paths with few or many colors in colored directed graphs / X. Li, S. Zhang and H.J. Broersmaschema:ProductModel
Forbidden subgraphs that imply Hamiltonian-connectedness / H.J. Broersma ... [et al.]schema:ProductModel
Hamiltonicity of regular 2-connected graphs / H.J. Broersma ... [et al.]schema:ProductModel
Heavy paths and cycles in weighted graphs / S. Zhang, X. Li and H.J. Broersmaschema:ProductModel
Heavy paths and cycles in weighted graphs / S. Zhang, X. Li and H.J. Broersmaschema:ProductModel
Independent sets in asteroidal triple-free graphs / H.J. Broersma ... [et al.]schema:ProductModel
Long paths and cycles in tough graphs / H.J. Broersma ... [et al.]schema:ProductModel
More progress on tough graphs : the Y2K report / D. Bauer, H.J. Broersma and E. Schmeichelschema:ProductModel
Not every 2-tough graph is Hamiltonian / D. Bauer, H.J. Broersma and H.J. Veldmanschema:ProductModel
On generalizing a theorem of Jung / Douglas Bauer, H.J. Broersma, H.J. Veldmanschema:ProductModel
On smallest nonhamiltonian regular tough graphs / Douglas Bauer, H.J. Broersma, H.J. Veldmanschema:ProductModel
... show all 23