Works matching AU Broersma, H. J.

Results: 18

On hamiltonicity of P3-dominated graphs.

Published in:

Mathematical Methods of Operations Research, 2009, v. 69, n. 2, p. 297, doi. 10.1007/s00186-008-0260-7

By:

Broersma, H. J.;
Vumar, E.

Publication type:

Article

Toughness and Vertex Degrees.

Published in:

Journal of Graph Theory, 2013, v. 72, n. 2, p. 209, doi. 10.1002/jgt.21639

By:

Bauer, D.;
Broersma, H. J.;
van den Heuvel, J.;
Kahl, N.;
Schmeichel, E.

Publication type:

Article

Tutte sets in graphs I: Maximal tutte sets and Dâgraphs.

Published in:

Journal of Graph Theory, 2007, v. 55, n. 4, p. 343

By:

D. Bauer;
H. J. Broersma;
A. Morgana;
E. Schmeichel

Publication type:

Article

A new upper bound on the cyclic chromatic numberResearch for this article was done during visits of OVB, AG, and JvdH to the University of Twente, while HJB was employed there.

Published in:

Journal of Graph Theory, 2007, v. 54, n. 1, p. 58

By:

O. V. Borodin;
H. J. Broersma;
A. Glebov;
J. van den Heuvel

Publication type:

Article

On factors of 4-connected claw-free graphs*.

Published in:

Journal of Graph Theory, 2001, v. 37, n. 2, p. 125, doi. 10.1002/jgt.1008

By:

Broersma, H. J.;
Kriesell, M.;
Ryjác̆ek, Z.

Publication type:

Article

Toughness and longest cycles in 2-connected planar graphs.

Published in:

Journal of Graph Theory, 1996, v. 23, n. 3, p. 257, doi. 10.1002/(SICI)1097-0118(199611)23:3<257::AID-JGT5>3.0.CO;2-R

By:

Böhme, T.;
Broersma, H. J.;
Veldman, H. J.

Publication type:

Article

Hamiltonicity of regular 2-connected graphs.

Published in:

Journal of Graph Theory, 1996, v. 22, n. 2, p. 105, doi. 10.1002/(SICI)1097-0118(199606)22:2<105::AID-JGT2>3.0.CO;2-R

By:

Broersma, H. J.;
van den Heuvel, J.;
Jackson, B.;
Veldman, H. J.

Publication type:

Article

On graphs satisfying a local ore-type condition.

Published in:

Journal of Graph Theory, 1996, v. 21, n. 1, p. 1, doi. 10.1002/(SICI)1097-0118(199601)21:1<1::AID-JGT1>3.0.CO;2-W

By:

Asratian, A. S.;
Broersma, H. J.;
Van den Heuvel, J.;
Veldman, H. J.

Publication type:

Article

Cycles through particular subgraphs of claw-free graphs.

Published in:

Journal of Graph Theory, 1995, v. 20, n. 4, p. 459, doi. 10.1002/jgt.3190200409

By:

Broersma, H. J.;
Lu, M.

Publication type:

Article

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

Published in:

Journal of Graph Theory, 1993, v. 17, n. 5, p. 613, doi. 10.1002/jgt.3190170508

By:

Broersma, H. J.;
Duijvestijn, A. J. W.;
Göbel, F.

Publication type:

Article

Cycles containing all vertices of maximum degree.

Published in:

Journal of Graph Theory, 1993, v. 17, n. 3, p. 373, doi. 10.1002/jgt.3190170311

By:

Broersma, H. J.;
Van Heuvel, J. Den;
Jung, H. A.;
Veldman, H. J.

Publication type:

Article

The connectivity of the basis graph of a branching greedoid.

Published in:

Journal of Graph Theory, 1992, v. 16, n. 3, p. 233, doi. 10.1002/jgt.3190160306

By:

Broersma, H. J.;
Xueliang, Li

Publication type:

Article

Long dominating cycles and paths in graphs with large neighborhood unions.

Published in:

Journal of Graph Theory, 1991, v. 15, n. 1, p. 29, doi. 10.1002/jgt.3190150106

By:

Broersma, H. J.;
Veldman, H. J.

Publication type:

Article

Path graphs.

Published in:

Journal of Graph Theory, 1989, v. 13, n. 4, p. 427, doi. 10.1002/jgt.3190130406

By:

Broersma, H. J.;
Hoede, C.

Publication type:

Article

Existence of Δλ-cycles and Δλ-paths.

Published in:

Journal of Graph Theory, 1988, v. 12, n. 4, p. 499, doi. 10.1002/jgt.3190120405

By:

Broersma, H. J.

Publication type:

Article

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

Published in:

Journal of Graph Theory, 1987, v. 11, n. 3, p. 399, doi. 10.1002/jgt.3190110314

By:

Broersma, H. J.;
Veldman, H. J.

Publication type:

Article

Bipartite regular graphs with fixed diameter.

Published in:

Networks, 1995, v. 26, n. 3, p. 139, doi. 10.1002/net.3230260303

By:

Broersma, H. J.;
Göbel, F.

Publication type:

Article

Decomposition of bipartite graphs under degree constraints.

Published in:

Networks, 1993, v. 23, n. 3, p. 159, doi. 10.1002/net.3230230303

By:

Broersma, H. J.;
Faudree, R. J.;
Van Heuvel, J. Den;
Veldman, H. J.

Publication type:

Article

Works matching AU Broersma, H. J.

On hamiltonicity of P<sub>3</sub>-dominated graphs.

Toughness and Vertex Degrees.

Tutte sets in graphs I: Maximal tutte sets and Dâgraphs.

A new upper bound on the cyclic chromatic numberResearch for this article was done during visits of OVB, AG, and JvdH to the University of Twente, while HJB was employed there.

On factors of 4-connected claw-free graphs*.

Toughness and longest cycles in 2-connected planar graphs.

Hamiltonicity of regular 2-connected graphs.

On graphs satisfying a local ore-type condition.

Cycles through particular subgraphs of claw-free graphs.

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

Cycles containing all vertices of maximum degree.

The connectivity of the basis graph of a branching greedoid.

Long dominating cycles and paths in graphs with large neighborhood unions.

Path graphs.

Existence of Δ<sub>λ</sub>-cycles and Δ<sub>λ</sub>-paths.

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

Bipartite regular graphs with fixed diameter.

Decomposition of bipartite graphs under degree constraints.