The following pages link to Hajo J. Broersma (Q339483):
Displayed 50 items.
- Item:Q339483 (redirect page) (← links)
- Item:Q234411 (redirect page) (← links)
- Narrowing down the gap on cycle-star Ramsey numbers (Q286769) (← links)
- On fan-wheel and tree-wheel Ramsey numbers (Q297927) (← links)
- Forbidden subgraphs for Hamiltonicity of 1-tough graphs (Q339484) (← links)
- Tight complexity bounds for FPT subgraph problems parameterized by the clique-width (Q388791) (← links)
- Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time (Q417995) (← links)
- More about subcolorings (Q424720) (← links)
- Pairs of forbidden induced subgraphs for homogeneously traceable graphs (Q449119) (← links)
- The complexity of finding uniform sparsest cuts in various graph classes (Q450559) (← links)
- Best monotone degree conditions for graph properties: a survey (Q489335) (← links)
- Closing the gap on path-kipas Ramsey numbers (Q490404) (← links)
- How many conjectures can you stand? A survey (Q659764) (← links)
- On ``The matching polynomial of a polygraph'' (Q689958) (← links)
- Updating the complexity status of coloring graphs without a fixed induced linear forest (Q764301) (← links)
- Some algorithmic results for finding compatible spanning circuits in edge-colored graphs (Q830935) (← links)
- Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs (Q844222) (← links)
- Eliminating graphs by means of parallel knock-out schemes (Q867852) (← links)
- Toughness and Hamiltonicity in \(k\)-trees (Q868350) (← links)
- On Ramsey numbers for paths versus wheels (Q868372) (← links)
- Three results on cycle-wheel Ramsey numbers (Q897298) (← links)
- Computing sharp 2-factors in claw-free graphs (Q988693) (← links)
- Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks (Q998345) (← links)
- Some families of integral graphs (Q998379) (← links)
- Complexity of conditional colorability of graphs (Q1003864) (← links)
- Upper bounds and algorithms for parallel knock-out numbers (Q1008728) (← links)
- On hamiltonicity of \(P_{3}\)-dominated graphs (Q1014310) (← links)
- \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings (Q1045046) (← links)
- A generalization of a result of Häggkvist and Nicoghossian (Q1096650) (← links)
- A note on \(K_ 4\)-closures in hamiltonian graph theory (Q1309444) (← links)
- Long cycles, degree sums and neighborhood unions (Q1309446) (← links)
- A closure concept based on neighborhood unions of independent triples (Q1313822) (← links)
- A generalization of Ore's Theorem involving neighborhood unions (Q1313847) (← links)
- Subgraphs, closures and hamiltonicity (Q1329802) (← links)
- A fan type condition for heavy cycles in weighted graphs (Q1348663) (← links)
- A generalization of AT-free graphs and a generic algorithm for solving triangulation problems (Q1348907) (← links)
- Dirac's minimum degree condition restricted to claws (Q1356453) (← links)
- A note on the minimum size of a vertex pancyclic graph (Q1356690) (← links)
- Cycles through subsets with large degree sums (Q1363686) (← links)
- Closure concepts for claw-free graphs (Q1584245) (← links)
- Heavy paths and cycles in weighted graphs (Q1587616) (← links)
- Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion (Q1613360) (← links)
- A note on minimum degree conditions for supereulerian graphs (Q1613362) (← links)
- Some approaches to a conjecture on short cycles in digraphs (Q1613363) (← links)
- On some intriguing problems in Hamiltonian graph theory---a survey (Q1613468) (← links)
- Conditions for graphs to be path partition optimal (Q1709536) (← links)
- Properly edge-colored theta graphs in edge-colored complete graphs (Q1733876) (← links)
- Decompositions of graphs based on a new graph product (Q1735673) (← links)
- The Hamiltonian index of a graph and its branch-bonds (Q1877671) (← links)
- Long cycles in graphs with prescribed toughness and minimum degree (Q1894753) (← links)
- Degree sequences and the existence of \(k\)-factors (Q1926057) (← links)