The following pages link to Hajo J. Broersma (Q339483):
Displayed 50 items.
- (Q2816051) (← links)
- (Q2816508) (← links)
- (Q2828895) (← links)
- Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs (Q2864296) (← links)
- Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width (Q2891349) (← links)
- The Complexity Status of Problems Related to Sparsest Cuts (Q3000501) (← links)
- On stability of the hamiltonian index under contractions and closures (Q3022733) (← links)
- (Q3046488) (← links)
- Narrowing Down the Gap on the Complexity of Coloring P k -Free Graphs (Q3057613) (← links)
- On Coloring Graphs without Induced Forests (Q3060770) (← links)
- Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs (Q3106266) (← links)
- (Q3201099) (← links)
- (Q3211339) (← links)
- Philosophy of Computation (Q3295749) (← links)
- Computability and Complexity of Unconventional Computing Devices (Q3295750) (← links)
- Long dominating cycles and paths in graphs with large neighborhood unions (Q3353048) (← links)
- A new upper bound on the cyclic chromatic number (Q3418734) (← links)
- On-Line Coloring of H-Free Bipartite Graphs (Q3434564) (← links)
- The Ramsey Numbers of Paths Versus Kipases (Q3439162) (← links)
- Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks (Q3439565) (← links)
- Backbone colorings for graphs: Tree and path backbones (Q3445508) (← links)
- (Q3470493) (← links)
- On components of 2-factors in claw-free graphs (Q3503486) (← links)
- (Q3517248) (← links)
- The Computational Complexity of the Parallel Knock-Out Problem (Q3525764) (← links)
- Tutte sets in graphs I: Maximal tutte sets and D-graphs (Q3594956) (← links)
- Computing Sharp 2-Factors in Claw-Free Graphs (Q3599127) (← links)
- A New Algorithm for On-line Coloring Bipartite Graphs (Q3614195) (← links)
- Three Complexity Results on Coloring P k -Free Graphs (Q3651537) (← links)
- Fully Decomposable Split Graphs (Q3651538) (← links)
- (Q3781785) (← links)
- (Q3791178) (← links)
- 3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian (Q3803150) (← links)
- Existence of Δλ-cycles and Δλ-paths (Q3812274) (← links)
- (Q3816095) (← links)
- Path graphs (Q3832614) (← links)
- (Q3971997) (← links)
- The connectivity of the basis graph of a branching greedoid (Q4013425) (← links)
- Cycles containing all vertices of maximum degree (Q4201393) (← links)
- Spanning trees with many or few colors in edge-colored graphs (Q4210669) (← links)
- (Q4218149) (← links)
- (Q4232780) (← links)
- (Q4242952) (← links)
- (Q4254359) (← links)
- Independent Sets in Asteroidal Triple-Free Graphs (Q4255822) (← links)
- Toughness, minimum degree, and the existence of 2‐factors (Q4309982) (← links)
- (Q4373674) (← links)
- (Q4374709) (← links)
- (Q4411360) (← links)
- (Q4414486) (← links)