No photo of Hajo Broersma

Hajo Broersma

prof.dr.ir.

1987 …2019
If you made any changes in Pure these will be visible here soon.

Research Output 1987 2019

1994

A note on the minimum size of a vertex pancyclic graph

Broersma, H. J., 1994, University of Twente, Faculty of Mathematical Sciences. 7 p. (Memorandum Faculty of Mathematical Sciences; no. 1233)

Research output: Book/ReportReportProfessional

Bipartite regular graphs with fixed diameter

Broersma, H. J. & Gobel, F., 1994, University of Twente, Faculty of Mathematical Sciences. 14 p. (Memorandum Faculty of Mathematical Sciences; no. 1205)

Research output: Book/ReportReportProfessional

Cycles through subsets with large degree sums

Broersma, H., Li, H., Li, J., Tian, F. & Veldman, H. J., 1994, University of Twente, Faculty of Mathematical Sciences. 13 p. (Memorandum Faculty of Mathematical Sciences; no. 1207)

Research output: Book/ReportReportProfessional

Hamiltonicity of regular 2-connected graphs

Broersma, H. J., van den Heuvel, J. P. M., Jackson, B. & Veldman, H. J., 1994, University of Twente, Faculty of Mathematical Sciences. 24 p. (Memorandum Faculty of Mathematical Sciences; no. 1206)

Research output: Book/ReportReportProfessional

9 Citations (Scopus)

On hamiltonian properties of 2-tough graphs

Bauer, D., Broersma, H. J., van den Heuvel, J. P. M. & Veldman, H. J., 1994, In : Journal of graph theory. 18, p. 539-543 5 p.

Research output: Contribution to journalArticleAcademicpeer-review

1 Citation (Scopus)
222 Downloads (Pure)

Subgraphs, Closures and Hamiltonicity

Broersma, H. J. & Schiermeyer, I., 1994, In : Discrete applied mathematics. 51, 1-2, p. 39-46 8 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
Hamiltonians
Hamiltonicity
Subgraph
Closure
Hamiltonian Graph

Unifying results on Hamiltonian claw-free graphs

Broersma, H. J., Ryjácek, Z. & Schiermeyer, I., 1994, University of Twente, Faculty of Mathematical Sciences. 11 p. (Memorandum Faculty of Mathematical Sciences; no. 1234)

Research output: Book/ReportReportProfessional

1993
19 Citations (Scopus)
62 Downloads (Pure)

A generalization of Ore's Theorem involving neighborhood unions

Broersma, H. J., van den Heuvel, J. P. M., van den Heuvel, J. & Veldman, H. J., 1993, In : Discrete mathematics. 122, 122, p. 37-49 13 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
9 Citations (Scopus)
430 Downloads (Pure)

A note on K4-closures in Hamiltonian graph theory

Broersma, H. J., 1993, In : Discrete mathematics. 121, 121, p. 19-23 5 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
Hamiltonian Graph
Hamiltonians
Graph theory
Closure
If and only if
1 Citation (Scopus)
30 Downloads (Pure)

Coloring a graph optimally with two colors

Broersma, H. J. & Gobel, F., 1993, In : Discrete mathematics. 118, 1-3, p. 23-31

Research output: Contribution to journalArticleAcademic

Open Access
File
4 Citations (Scopus)
40 Downloads (Pure)

Cycles containing all vertices of maximum degree

Broersma, H. J., van den Heuvel, J. P. M., van den Heuvel, J., Jung, H. A. & Veldman, H. J., 1993, In : Journal of graph theory. 17, 17, p. 373-385 13 p.

Research output: Contribution to journalArticleAcademicpeer-review

File
47 Downloads (Pure)

Decomposition of bipartite graphs under degree constraints

Broersma, H. J., Faudree, R. J., van den Heuvel, J., van den Heuvel, J. P. M. & Veldman, H. J., 1993, In : Networks. 23, 23, p. 159-164 6 p.

Research output: Contribution to journalArticleAcademicpeer-review

File
20 Citations (Scopus)
468 Downloads (Pure)

Generating all 3-connected 4-regular planar graphs from the octahedron graph

Broersma, H. J., Duijvestijn, A. J. W., Duijvestijn, A. J. W. & Gobel, F., 1993, In : Journal of graph theory. 17, 5, p. 613-620 8 p.

Research output: Contribution to journalArticleAcademicpeer-review

File
Octahedron
Regular Graph
Planar graph
Graph in graph theory
Alternatives
5 Citations (Scopus)
18 Downloads (Pure)

Long cycles, degree sums and neighborhoods unions

Broersma, H. J., van den Heuvel, J. P. M., van den Heuvel, J. & Veldman, H. J., 1993, In : Discrete mathematics. 121, 121, p. 25-35 11 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File

Long cycles in graphs with prescribed toughness and minimum degree

Broersma, H. J., Bauer, D., van den Heuvel, J. P. M. & Veldman, H. J., 1993, University of Twente, Faculty of Mathematical Sciences. 13 p. (Memorandum Faculty of Mathematical Sciences; no. 1109)

Research output: Book/ReportReportProfessional

7 Citations (Scopus)

Long paths and cycles in tough graphs

Broersma, H. J., van den Heuvel, J. P. M., Jung, H. A. & Veldman, H. J., 1993, In : Graphs and combinatorics. 9, p. 3-17 15 p.

Research output: Contribution to journalArticleAcademicpeer-review

On graphs satisfying a local Ore-type condition

Broersma, H. J., Asratian, A. S., van den Heuvel, J. P. M. & Veldman, H. J., 1993, University of Twente, Faculty of Mathematical Sciences. 12 p. (Memorandum Faculty of Mathematical Sciences; no. 1139)

Research output: Book/ReportReportProfessional

3 Citations (Scopus)
24 Downloads (Pure)

On "The matching polynomial of a polygraph"

Broersma, H. J., Li, X. & Li, X., 1993, In : Discrete applied mathematics. 46, 1, p. 79-86 8 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
Matching Polynomial
Recurrence relation
Polynomials
Symmetry

Toughness and hamiltonicity in almost claw-free graphs

Broersma, H. J., Ryjácek, Z. & Schiermeyer, I., 1993, University of Twente, Faculty of Mathematical Sciences. 10 p. (Memorandum Faculty of Mathematical Sciences; no. 1114)

Research output: Book/ReportReportProfessional

Trees are graceful if and only if trees with a perfect matching are strongly graceful

Broersma, H. J. & Hoede, C., 1993, University of Twente, Faculty of Mathematical Sciences. 7 p. (Memorandum Faculty of Mathematical Sciences; no. 1167)

Research output: Book/ReportReportProfessional

1992

Contributions to the Twente Workshop on Hamiltonian Graph Theory

Broersma, H. J., van den Heuvel, J. P. M. & Veldman, H. J., 1992, University of Twente, Faculty of Mathematical Sciences. 96 p. (Memorandum Faculty of Mathematical Sciences; no. 1043)

Research output: Book/ReportReportProfessional

Cycles containing all vertices of maximum degree

Broersma, H. J., van den Heuvel, J. P. M., Jung, H. A. & Veldman, H. J., 1992, University of Twente, Faculty of Mathematical Sciences. 14 p. (Memorandum Faculty of Mathematical Sciences; no. 1044)

Research output: Book/ReportReportProfessional

Cycles through particular subgraphs of claw-free graphs

Broersma, H. J. & Lu, M., 1992, University of Twente, Faculty of Mathematical Sciences. 9 p. (Memorandum Faculty of Mathematical Sciences; no. 1097)

Research output: Book/ReportReportProfessional

On hamiltonian properties of 2-tough graphs

Bauer, D., Broersma, H. J., van den Heuvel, J. P. M. & Veldman, H. J., 1992, University of Twente, Faculty of Mathematical Sciences. 7 p. (Memorandum Faculty of Mathematical Sciences; no. 1037)

Research output: Book/ReportReportProfessional

8 Citations (Scopus)
49 Downloads (Pure)

The connectivity of the basis graph of a branching greedoid

Broersma, H. J., Li, X. & Li, X., 1992, In : Journal of graph theory. 16, 3, p. 233-237 5 p.

Research output: Contribution to journalArticleAcademicpeer-review

File
Branching
Connectivity
Graph in graph theory
Multigraph
Roots

Updated contributions to the Twente Workshop on Hamiltonian Graph Theory

Broersma, H. J., van den Heuvel, J. P. M. & Veldman, H. J., 1992, University of Twente, Faculty of Mathematical Sciences. 122 p. (Memorandum Faculty of Mathematical Sciences; no. 1076)

Research output: Book/ReportReportProfessional

1991

A closure concept based on neighborhood unions of indipendent triples

Broersma, H. J. & Schiermeyer, I., 1991, University of Twente, Faculty of Mathematical Sciences. 14 p. (Memorandum Faculty of Mathematical Sciences; no. 931)

Research output: Book/ReportReportProfessional

Decomposition of bipartite graphs under degree constraints

Broersma, H. J., Faudree, R. J., van den Heuvel, J. P. M. & Veldman, H. J., 1991, University of Twente, Faculty of Mathematical Sciences. 9 p. (Memorandum Faculty of Mathematical Sciences; no. 984)

Research output: Book/ReportReportProfessional

7 Citations (Scopus)
55 Downloads (Pure)

Long dominating cycles and paths in graphs with large neighborhood unions

Broersma, H. J. & Veldman, H. J., 1991, In : Journal of graph theory. 0, 15, p. 29-40 12 p.

Research output: Contribution to journalArticleAcademicpeer-review

File

Long paths and cycles in tough graphs

Broersma, H. J., van den Heuvel, J. P. M., Jung, H. A. & Veldman, H. J., 1991, University of Twente, Faculty of Applied Mathematics. 16 p. (Memorandum Faculty of Applied Mathematics; no. 946)

Research output: Book/ReportReportProfessional

Optimal copying strategies

Broersma, H. J. & Gobel, F., 1991, University of Twente, Faculty of Applied Mathematics. 6 p. (Memorandum Faculty of Applied Mathematics; no. 1005)

Research output: Book/ReportReportProfessional

Subgraphs, closures and hamiltonicity

Broersma, H. J. & Schiermeyer, I., 1991, University of Twente, Faculty of Applied Mathematics. 7 p. (Memorandum Faculty of Applied Mathematics; no. 998)

Research output: Book/ReportReportProfessional

The connectivity of the basis graph of a branching greedoid

Broersma, H. J. & Li, X., 1991, Enschede: University of Twente. 8 p. (Memorandum Faculty of Mathematical Sciences; no. 937)

Research output: Book/ReportReportProfessional

The connectivity of the leaf-exchange spanning tree graph of a graph

Broersma, H. J. & Li, X., 1991, Enschede: University of Twente. 8 p. (Memorandum Faculty of Mathematical Sciences; no. 969)

Research output: Book/ReportReportProfessional

1990

A closure concept based on degree-sums of independent triples

Broersma, H. J. & Schiermeyer, I., 1990, University of Twente, Faculty of Applied Mathematics. 14 p. (Memorandum Faculty of Applied Mathematics; no. 864)

Research output: Book/ReportReportProfessional

A note on K4-closures in hamiltonian graph theory

Broersma, H. J., 1990, University of Twente, Faculty of Applied Mathematics. (Memorandum Faculty of Applied Mathematics; no. 903)

Research output: Book/ReportReportProfessional

A note on "the matching polynomial of a polygraph"

Broersma, H. J. & Li xueliang, N., 1990, University of Twente, Faculty of Applied Mathematics. 9 p. (Memorandum Faculty of Applied Mathematics; no. 910)

Research output: Book/ReportReportProfessional

Around three lemmas in hamiltonian graph theory

Bauer, D., Broersma, H. J. & Veldman, H. J., 1990, Topics in Combinatorics and Graph Theory.. Heidelberg: R. Bodendiek and R. Henn, p. 101-110 10 p.

Research output: Chapter in Book/Report/Conference proceedingChapterAcademic

Generating all 3-connected 4-regular planar graphs from the Octahedron Graph

Broersma, H. J., Duijvestijn, A. J. W. & Gobel, F., 1990, University of Twente, Faculty of Applied Mathematics. 9 p. (Memorandum Faculty of Mathematical Sciences; no. 854)

Research output: Book/ReportReportProfessional

k-Traversable graphs

Broersma, H. J. & Gobel, F., 1990, In : Ars combinatoria. 0, p. 141-153 13 p.

Research output: Contribution to journalArticleAcademicpeer-review

Long cycles, degree sums and neighborhood unions

Broersma, H. J., van den Heuvel, J. P. M. & Veldman, H. J., 1990, University of Twente, Faculty of Mathematical Sciences. 21 p. (Memorandum Faculty of Mathematical Sciences; no. 851)

Research output: Book/ReportReportProfessional

On smallest nonhamiltonian regular tough graphs

Bauer, D., Broersma, H. J. & Veldman, H. J., 1990, In : Congressus numerantium. 0, 70, p. 95-98 4 p.

Research output: Contribution to journalArticleAcademicpeer-review

Remarks on hamiltonian properties of claw-free graphs

Ainouche, A., Broersma, H. J. & Veldman, H. J., 1990, In : Ars combinatoria. 0, p. 110-121 12 p.

Research output: Contribution to journalArticleAcademicpeer-review

Restrictions on induced subgraphs ensuring hamiltonicity or pancyclicity of K1,3-free graphs

Broersma, H. J. & Veldman, H. J., 1990, Festschrift in honour of Klaus Wagner. p. -

Research output: Chapter in Book/Report/Conference proceedingChapterAcademic

1989
29 Citations (Scopus)
45 Downloads (Pure)

A generalization of a result of Häggkvist and Nicoghossian

Bauer, D., Broersma, H. J., Veldman, H. J. & Rao, L., 1989, In : Journal of Combinatorial Theory, Series B. 47, 2, p. 237-243

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
Hamiltonians
Connected graph
Closure
Connectivity
Theorem
42 Citations (Scopus)
217 Downloads (Pure)

Path graphs

Broersma, H. J. & Hoede, C., Sep 1989, In : Journal of graph theory. 13, 4, p. 427-444 18 p.

Research output: Contribution to journalArticleAcademic

File
Path
Graph in graph theory
Hamiltonian Graph
Unicyclic Graph
Line Graph
1988
10 Citations (Scopus)
43 Downloads (Pure)

Existence of Δλ-cycles and Δλ-paths

Broersma, H. J., 1988, In : Journal of graph theory. 12, 4, p. 499-507

Research output: Contribution to journalArticleAcademic

File
1987
15 Citations (Scopus)
74 Downloads (Pure)

3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian

Broersma, H. J. & Veldman, H. J., 1987, In : Journal of graph theory. 11, 3, p. 399-407

Research output: Contribution to journalArticleAcademic

File