H. J. Broersma - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 35 from 35

2013

Toughness and Vertex DegreesDouglas Bauer, H. J. Broersma, Jan van den Heuvel, Nathan Kahl, Edward F. Schmeichel. jgt, 72(2):209-219, 2013. [doi]

Tank-Ring Factors in Supereulerian Claw-Free GraphsMingChu Li, Lifeng Yuan, He Jiang, Bing Liu, H. J. Broersma. gc, 29(3):599-608, 2013. [doi]

2012

Degree Sequences and the Existence of k-FactorsDouglas Bauer, H. J. Broersma, Jan van den Heuvel, Nathan Kahl, Edward F. Schmeichel. gc, 28(2):149-166, 2012. [doi]

How Many Conjectures Can You Stand? A SurveyH. J. Broersma, Zdenek Ryjácek, Petr Vrána. gc, 28(1):57-75, 2012. [doi]

2009

lambda-backbone colorings along pairwise disjoint stars and matchingsH. J. Broersma, Jun Fujisawa, L. Marchal, Daniël Paulusma, A. N. M. Salman, Kiyoshi Yoshimoto. DM, 309(18):5596-5609, 2009. [doi]

2008

Connected even factors in claw-free graphsMingChu Li, Liming Xiong, H. J. Broersma. DM, 308(11):2282-2284, 2008. [doi]

2007

Path-kipas Ramsey numbersA. N. M. Salman, H. J. Broersma. DAM, 155(14):1878-1884, 2007. [doi]

2004

The Ramsey Numbers of Paths Versus KipasesA. N. M. Salman, H. J. Broersma. endm, 17:251-255, 2004. [doi]

2003

The Ramsey Numbers of Paths Versus FansA. N. M. Salman, H. J. Broersma. endm, 13:103-107, 2003. [doi]

2001

On factors of 4-connected claw-free graphsH. J. Broersma, Matthias Kriesell, Zdenek Ryjácek. jgt, 37(2):125-136, 2001. [doi]

1997

A note on the minimum size of a vertex pancyclic graphH. J. Broersma. DM, 164(1-3):29-32, 1997. [doi]

Dirac s minimum degree condition restricted to clawsH. J. Broersma, Zdenek Ryjácek, Ingo Schiermeyer. DM, 167-168:155-166, 1997. [doi]

1996

On graphs satisfying a local ore-type conditionArmen S. Asratian, H. J. Broersma, Jan van den Heuvel, Henk Jan Veldman. jgt, 21(1):1-10, 1996. [doi]

Hamiltonicity of regular 2-connected graphsH. J. Broersma, Jan van den Heuvel, B. Jackson, Henk Jan Veldman. jgt, 22(2):105-124, 1996. [doi]

Toughness and hamiltonicity in almost claw-free graphsH. J. Broersma, Zdenek Ryjácek, Ingo Schiermeyer. jgt, 21(4):431-439, 1996. [doi]

Toughness and longest cycles in 2-connected planar graphsThomas Böhme, H. J. Broersma, Henk Jan Veldman. jgt, 23(3):257-263, 1996. [doi]

1995

Long cycles in graphs with prescribed toughness and minimum degreeDouglas Bauer, H. J. Broersma, J. van den Heuvel, Henk Jan Veldman. DM, 141(1-3):1-10, 1995. [doi]

On generalizing a theorem of JungDouglas Bauer, H. J. Broersma, Henk Jan Veldman. arscom, 40, 1995.

Cycles through particular subgraphs of claw-free graphsH. J. Broersma, M. Lu. jgt, 20(4):459-465, 1995. [doi]

Bipartite regular graphs with fixed diameterH. J. Broersma, F. Göbel. networks, 26(3):139-144, 1995. [doi]

1994

A closure concept based on neighborhood unions of independent triplesH. J. Broersma, Ingo Schiermeyer. DM, 124(1-3):37-47, 1994. [doi]

1993

Long cycles, degree sums and neighborhood unionsH. J. Broersma, J. van den Heuvel, Henk Jan Veldman. DM, 121(1-3):25-35, 1993. [doi]

Coloring a graph optimally with two colorsH. J. Broersma, F. Göbel. DM, 118(1-3):23-31, 1993. [doi]

A note on K::4::-closures in hamiltonian graph theoryH. J. Broersma. DM, 121(1-3):19-23, 1993. [doi]

A generalization of Ore s Theorem involving neighborhood unionsH. J. Broersma, J. van den Heuvel, Henk Jan Veldman. DM, 122(1-3):37-49, 1993. [doi]

Long paths and cycles in tough graphsH. J. Broersma, Jan van den Heuvel, H. A. Jung, Henk Jan Veldman. gc, 9(1):3-17, 1993. [doi]

Cycles containing all vertices of maximum degreeH. J. Broersma, Johan H. C. van den Heuvel, H. A. Jung, Henk Jan Veldman. jgt, 17(3):373-385, 1993. [doi]

Decomposition of bipartite graphs under degree constraintsH. J. Broersma, Ralph J. Faudree, Johan H. C. van den Heuvel, Henk Jan Veldman. networks, 23(3):159-164, 1993. [doi]

Generating all 3-connected 4-regular planar graphs from the octahedron graphH. J. Broersma, A. J. W. Duijvestijn, F. Göbel. jgt, 17(5):613-620, 1993. [doi]

1992

The connectivity of the basis graph of a branching greedoidH. J. Broersma, Xueliang Li. jgt, 16(3):233-237, 1992. [doi]

An Affirmative Action Graph (D. J. Newman)H. J. Broersma, Andy Liu, L. V. Saxton. siamrev, 34(4):652-653, 1992. [doi]

1991

Long dominating cycles and paths in graphs with large neighborhood unionsH. J. Broersma, Henk Jan Veldman. jgt, 15(1):29-38, 1991. [doi]

1989

Path graphsH. J. Broersma, Cornelis Hoede. jgt, 13(4):427-444, 1989. [doi]

1988

λ-pathsH. J. Broersma. jgt, 12(4):499-507, 1988. [doi]

1987

3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonianH. J. Broersma, Henk Jan Veldman. jgt, 11(3):399-407, 1987. [doi]

Sign in or sign up to see more results.

runs on WebDSL