Works matching AU Broersma, Hajo
Results: 37
Sharp Upper Bounds on the Minimum Number of Components of 2-factors in Claw-free Graphs.
- Published in:
- Graphs & Combinatorics, 2009, v. 25, n. 4, p. 427, doi. 10.1007/s00373-009-0855-7
- By:
- Publication type:
- Article
Toughness in Graphs – A Survey.
- Published in:
- Graphs & Combinatorics, 2006, v. 22, n. 1, p. 1, doi. 10.1007/s00373-006-0649-0
- By:
- Publication type:
- Article
A NOTE ON RAMSEY NUMBERS FOR FANS.
- Published in:
- Bulletin of the Australian Mathematical Society, 2015, v. 92, n. 1, p. 19, doi. 10.1017/S0004972715000398
- By:
- Publication type:
- Article
List Edge Colorings of Planar Graphs without Non-induced 7-cycles.
- Published in:
- Acta Mathematica Sinica, 2025, v. 41, n. 3, p. 1037, doi. 10.1007/s10114-025-2761-1
- By:
- Publication type:
- Article
Backbone colorings for graphs: Tree and path backbonesPart of the work was done while FVF and PAG were visiting the University of Twente.
- Published in:
- Journal of Graph Theory, 2007, v. 55, n. 2, p. 137
- By:
- Publication type:
- Article
On stability of the hamiltonian index under contractions and closures.
- Published in:
- Journal of Graph Theory, 2005, v. 49, n. 2, p. 104
- By:
- Publication type:
- Article
Forbidden subgraphs that imply hamiltonian-connectedness*.
- Published in:
- Journal of Graph Theory, 2002, v. 40, n. 2, p. 104, doi. 10.1002/jgt.10034
- By:
- Publication type:
- Article
Independence trees and Hamilton cycles.
- Published in:
- Journal of Graph Theory, 1998, v. 29, n. 4, p. 227, doi. 10.1002/(SICI)1097-0118(199812)29:4<227::AID-JGT2>3.0.CO;2-W
- By:
- Publication type:
- Article
Degree-preserving trees.
- Published in:
- Networks, 2000, v. 35, n. 1, p. 26, doi. 10.1002/(SICI)1097-0037(200001)35:1<26::AID-NET3>3.0.CO;2-M
- By:
- Publication type:
- Article
Various results on the toughness of graphs.
- Published in:
- Networks, 1999, v. 33, n. 3, p. 233, doi. 10.1002/(SICI)1097-0037(199905)33:3<233::AID-NET9>3.0.CO;2-A
- By:
- Publication type:
- Article
More About Subcolorings.
- Published in:
- Computing, 2002, v. 69, n. 3, p. 187, doi. 10.1007/s00607-002-1461-1
- By:
- Publication type:
- Article
FORBIDDEN SUBGRAPHS FOR HAMILTONICITY OF 1-TOUGH GRAPHS.
- Published in:
- Discussiones Mathematicae: Graph Theory, 2016, v. 36, n. 4, p. 915, doi. 10.7151/dmgt.1897
- By:
- Publication type:
- Article
HEAVY SUBGRAPH PAIRS FOR TRACEABILITY OF BLOCK-CHAINS.
- Published in:
- Discussiones Mathematicae: Graph Theory, 2014, v. 34, n. 2, p. 287, doi. 10.7151/dmgt.1737
- By:
- Publication type:
- Article
BACKBONE COLORINGS ALONG STARS AND MATCHINGS IN SPLIT GRAPHS: THEIR SPAN IS CLOSE TO THE CHROMATIC NUMBER.
- Published in:
- Discussiones Mathematicae: Graph Theory, 2009, v. 29, n. 1, p. 143, doi. 10.7151/dmgt.1437
- By:
- Publication type:
- Article
Spectral properties of inverse sum indeg index of graphs.
- Published in:
- Journal of Mathematical Chemistry, 2020, v. 58, n. 9, p. 2108, doi. 10.1007/s10910-020-01170-x
- By:
- Publication type:
- Article
Sufficient Spectral Radius Conditions for Hamilton-Connectivity of k-Connected Graphs.
- Published in:
- Graphs & Combinatorics, 2021, v. 37, n. 6, p. 2467, doi. 10.1007/s00373-021-02369-8
- By:
- Publication type:
- Article
Toughness, Forbidden Subgraphs and Pancyclicity.
- Published in:
- Graphs & Combinatorics, 2021, v. 37, n. 3, p. 839, doi. 10.1007/s00373-021-02284-y
- By:
- Publication type:
- Article
Properly Edge-colored Theta Graphs in Edge-colored Complete Graphs.
- Published in:
- Graphs & Combinatorics, 2019, v. 35, n. 1, p. 261, doi. 10.1007/s00373-018-1989-2
- By:
- Publication type:
- Article
An Exact Formula for all Star-Kipas Ramsey Numbers.
- Published in:
- Graphs & Combinatorics, 2017, v. 33, n. 1, p. 141, doi. 10.1007/s00373-016-1746-3
- By:
- Publication type:
- Article
Three Results on Cycle-Wheel Ramsey Numbers.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 6, p. 2467, doi. 10.1007/s00373-014-1523-0
- By:
- Publication type:
- Article
Characterizing Heavy Subgraph Pairs for Pancyclicity.
- Published in:
- Graphs & Combinatorics, 2015, v. 31, n. 3, p. 649, doi. 10.1007/s00373-014-1406-4
- By:
- Publication type:
- Article
Removable Edges and Chords of Longest Cycles in 3-Connected Graphs.
- Published in:
- Graphs & Combinatorics, 2014, v. 30, n. 3, p. 743, doi. 10.1007/s00373-013-1296-x
- By:
- Publication type:
- Article
Some New Bounds for the Inverse Sum Indeg Energy of Graphs.
- Published in:
- Axioms (2075-1680), 2022, v. 11, n. 5, p. 243, doi. 10.3390/axioms11050243
- By:
- Publication type:
- Article
Growth rates of the bipartite Erdős–Gyárfás function.
- Published in:
- Journal of Graph Theory, 2024, v. 107, n. 3, p. 597, doi. 10.1002/jgt.23149
- By:
- Publication type:
- Article
Properly colored and rainbow C4 ${C}_{4}$'s in edge‐colored graphs.
- Published in:
- Journal of Graph Theory, 2024, v. 105, n. 1, p. 110, doi. 10.1002/jgt.23019
- By:
- Publication type:
- Article
The Erdős–Gyárfás function with respect to Gallai‐colorings.
- Published in:
- Journal of Graph Theory, 2022, v. 101, n. 2, p. 242, doi. 10.1002/jgt.22822
- By:
- Publication type:
- Article
Edge‐colored complete graphs without properly colored even cycles: A full characterization.
- Published in:
- Journal of Graph Theory, 2021, v. 98, n. 1, p. 110, doi. 10.1002/jgt.22684
- By:
- Publication type:
- Article
Vertex-disjoint properly edge-colored cycles in edge-colored complete graphs.
- Published in:
- Journal of Graph Theory, 2020, v. 94, n. 3, p. 476, doi. 10.1002/jgt.22536
- By:
- Publication type:
- Article
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs.
- Published in:
- Journal of Graph Theory, 2015, v. 79, n. 4, p. 282, doi. 10.1002/jgt.21832
- By:
- Publication type:
- Article
On Toughness and Hamiltonicity of 2 K<sub>2</sub>-Free Graphs.
- Published in:
- Journal of Graph Theory, 2014, v. 75, n. 3, p. 244, doi. 10.1002/jgt.21734
- By:
- Publication type:
- Article
Nascence Project: Nanoscale Engineering for Novel Computation Using Evolution.
- Published in:
- International Journal of Unconventional Computing, 2012, v. 8, n. 4, p. 313
- By:
- Publication type:
- Article
A NOTE ON MINIMUM DEGREE, BIPARTITE HOLES, AND HAMILTONIAN PROPERTIES.
- Published in:
- Discussiones Mathematicae: Graph Theory, 2024, v. 44, n. 2, p. 717, doi. 10.7151/dmgt.2464
- By:
- Publication type:
- Article
EDGE DEGREE CONDITIONS FOR DOMINATING AND SPANNING CLOSED TRAILS.
- Published in:
- Discussiones Mathematicae: Graph Theory, 2024, v. 44, n. 1, p. 363, doi. 10.7151/dmgt.2450
- By:
- Publication type:
- Article
TOUGHNESS, FORBIDDEN SUBGRAPHS, AND HAMILTON-CONNECTED GRAPHS.
- Published in:
- Discussiones Mathematicae: Graph Theory, 2022, v. 42, n. 1, p. 187, doi. 10.7151/dmgt.2247
- By:
- Publication type:
- Article
REMOVABLE EDGES ON A HAMILTON CYCLE OR OUTSIDE A CYCLE IN A 4-CONNECTED GRAPH.
- Published in:
- Discussiones Mathematicae: Graph Theory, 2021, v. 41, n. 2, p. 559, doi. 10.7151/dmgt.2209
- By:
- Publication type:
- Article
Polynomial algorithms for computing the isolated toughness of interval and split graphs.
- Published in:
- Concurrency & Computation: Practice & Experience, 2023, v. 35, n. 17, p. 1, doi. 10.1002/cpe.6345
- By:
- Publication type:
- Article
On hamiltonicity of 1-tough triangle-free graphs.
- Published in:
- Electronic Journal of Graph Theory & Applications, 2021, v. 9, n. 2, p. 433, doi. 10.5614/ejgta.2021.9.2.15
- By:
- Publication type:
- Article