Haitze J. Broersma

36 papers Journal 36

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	Edge degree conditions for dominating and spanning closed trails. Discuss. Math. Graph Theory Tao Tian, Haitze J. Broersma, Liming Xiong
2013	J	`jnl`	Tank-Ring Factors in Supereulerian Claw-Free Graphs. Graphs Comb. Mingchu Li, Lifeng Yuan, He Jiang, Bing Liu, Haitze J. Broersma
2013	J	`jnl`	Toughness and Vertex Degrees. J. Graph Theory Douglas Bauer, Haitze J. Broersma, Jan van den Heuvel, Nathan Kahl, Edward F. Schmeichel
2012	J	`jnl`	Degree Sequences and the Existence of k-Factors. Graphs Comb. Douglas Bauer, Haitze J. Broersma, Jan van den Heuvel, Nathan Kahl, Edward F. Schmeichel
2012	J	`jnl`	How Many Conjectures Can You Stand? A Survey. Graphs Comb. Haitze J. Broersma, Zdenek Ryjácek, Petr Vrána
2009	J	`jnl`	lambda-backbone colorings along pairwise disjoint stars and matchings. Discret. Math. Haitze J. Broersma, Jun Fujisawa, Bert Marchal, Daniël Paulusma, A. N. M. Salman, Kiyoshi Yoshimoto
2008	J	`jnl`	Connected even factors in claw-free graphs. Discret. Math. Mingchu Li, Liming Xiong, Haitze J. Broersma
2007	J	`jnl`	Path-kipas Ramsey numbers. Discret. Appl. Math. A. N. M. Salman, Haitze J. Broersma
2004	J	`jnl`	The Ramsey Numbers of Paths Versus Kipases. Electron. Notes Discret. Math. A. N. M. Salman, Haitze J. Broersma
2003	J	`jnl`	The Ramsey Numbers of Paths Versus Fans. Electron. Notes Discret. Math. A. N. M. Salman, Haitze J. Broersma
2001	J	`jnl`	On factors of 4-connected claw-free graphs. J. Graph Theory Haitze J. Broersma, Matthias Kriesell, Zdenek Ryjácek
1997	J	`jnl`	A note on the minimum size of a vertex pancyclic graph. Discret. Math. Haitze J. Broersma
1997	J	`jnl`	Dirac's minimum degree condition restricted to claws. Discret. Math. Haitze J. Broersma, Zdenek Ryjácek, Ingo Schiermeyer
1996	J	`jnl`	Hamiltonicity of regular 2-connected graphs. J. Graph Theory Haitze J. Broersma, Jan van den Heuvel, Bill Jackson, Henk Jan Veldman
1996	J	`jnl`	On graphs satisfying a local ore-type condition. J. Graph Theory Armen S. Asratian, Haitze J. Broersma, Jan van den Heuvel, Henk Jan Veldman
1996	J	`jnl`	Toughness and hamiltonicity in almost claw-free graphs. J. Graph Theory Haitze J. Broersma, Zdenek Ryjácek, Ingo Schiermeyer
1996	J	`jnl`	Toughness and longest cycles in 2-connected planar graphs. J. Graph Theory Thomas Böhme, Haitze J. Broersma, Henk Jan Veldman
1995	J	`jnl`	Bipartite regular graphs with fixed diameter. Networks Haitze J. Broersma, F. Göbel
1995	J	`jnl`	Cycles through particular subgraphs of claw-free graphs. J. Graph Theory Haitze J. Broersma, M. Lu
1995	J	`jnl`	Long cycles in graphs with prescribed toughness and minimum degree. Discret. Math. Douglas Bauer, Haitze J. Broersma, Jan van den Heuvel, Henk Jan Veldman
1995	J	`jnl`	On generalizing a theorem of Jung. Ars Comb. Douglas Bauer, Haitze J. Broersma, Henk Jan Veldman
1994	J	`jnl`	A closure concept based on neighborhood unions of independent triples. Discret. Math. Haitze J. Broersma, Ingo Schiermeyer
1993	J	`jnl`	A generalization of Ore's Theorem involving neighborhood unions. Discret. Math. Haitze J. Broersma, Jan van den Heuvel, Henk Jan Veldman
1993	J	`jnl`	A note on K Discret. Math. Haitze J. Broersma
1993	J	`jnl`	Coloring a graph optimally with two colors. Discret. Math. Haitze J. Broersma, F. Göbel
1993	J	`jnl`	Cycles containing all vertices of maximum degree. J. Graph Theory Haitze J. Broersma, Jan van den Heuvel, Heinz Adolf Jung, Henk Jan Veldman
1993	J	`jnl`	Decomposition of bipartite graphs under degree constraints. Networks Haitze J. Broersma, Ralph J. Faudree, Jan van den Heuvel, Henk Jan Veldman
1993	J	`jnl`	Generating all 3-connected 4-regular planar graphs from the octahedron graph. J. Graph Theory Haitze J. Broersma, A. J. W. Duijvestijn, F. Göbel
1993	J	`jnl`	Long cycles, degree sums and neighborhood unions. Discret. Math. Haitze J. Broersma, Jan van den Heuvel, Henk Jan Veldman
1993	J	`jnl`	Long paths and cycles in tough graphs. Graphs Comb. Haitze J. Broersma, Jan van den Heuvel, Heinz Adolf Jung, Henk Jan Veldman
1992	J	`jnl`	An Affirmative Action Graph (D. J. Newman). SIAM Rev. Haitze J. Broersma, Andy Liu, L. V. Saxton
1992	J	`jnl`	The connectivity of the basis graph of a branching greedoid. J. Graph Theory Haitze J. Broersma, Xueliang Li
1991	J	`jnl`	Long dominating cycles and paths in graphs with large neighborhood unions. J. Graph Theory Haitze J. Broersma, Henk Jan Veldman
1989	J	`jnl`	Path graphs. J. Graph Theory Haitze J. Broersma, Cornelis Hoede
1988	J	`jnl`	Existence of Δ J. Graph Theory Haitze J. Broersma
1987	J	`jnl`	3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian. J. Graph Theory Haitze J. Broersma, Henk Jan Veldman