Broersma, H.J. (Haitze Jouke), 1958-
Broersma, Hajo
Broersma, H J
Broersma, Hajo (1958- )
Broersma, Haitze Jouke
Hajo Broersma Ph.D. Universiteit Twente 1988
VIAF ID: 46279846 ( Personal )
Permalink: http://viaf.org/viaf/46279846
Preferred Forms
- 100 1 _ ‡a Broersma, H J
-
-
-
-
- 100 1 _ ‡a Broersma, Hajo
-
- 100 0 _ ‡a Hajo Broersma ‡c Ph.D. Universiteit Twente 1988
4xx's: Alternate Name Forms (7)
Works
Title | Sources |
---|---|
Algorithms and complexity in Durham 2005, c2005: | |
Algorithms for the treewidth and minimum fill-in of HHD-free graphs | |
A closure concept based on degree-sums of independent triples | |
Coloring a graph optimally with two colors | |
The connectivity of the leaf-exchange spanning tree graph of a graph | |
Cycles containing all vertices of maximum degree | |
Cycles through particular subgraphs of claw-free graphs | |
Cycles through subsets with large degree sums | |
Decomposition of bipartite graphs under degree constraints | |
Dirac's minimum degree condition restricted to claws | |
Existence of Dl-cycles | |
Forbidden subgraphs that imply Hamiltonian-connectedness | |
A generalization of AT-free graphs and a generic algorithm for solving triangulation problems | |
Generating all 3-connected 4-regular planar graphs from the Octahedron graph | |
Grafen in de praktijk | |
Graph-theoretic concepts in computer science : 34th international workshop, WG 2008, Durham, UK, June 30-July 2, 2008 : revised papers | |
Hamilton cycles in graphs and related topics | |
Hamiltonicity of regular 2-connected graphs | |
Heavy subgraph pairs for traceability of block-chains | |
Independent sets in asteroidal triple-free graphs | |
Isomorphisms and traversability of directed path graphs | |
K-traversable graphs II | |
Long dominating cycles and paths in graphs with large neighborhood unions | |
A note on a conjecture concerning tree-partitioning 3-regular graphs | |
A note on "the matching polynomial of a polygraph" | |
A note on the minimum size of a vertex pancyclic graph | |
On factors of 4-connected claw-free graphs | |
On generalizing a theorem of Jung | |
On minimum degree conditions for supereulerian graphs | |
On smallest nonhamiltonian regular tough graphs | |
On some intriguing problems in Hamiltonian graph theory : a survey | |
On the maximum period of a permutation of n elements | |
Optimal copying strategies | |
Some approaches to a conjecture on short cycles in digraphs | |
Spanning trees with many or few colors in edge-colored graphs | |
Special volume devoted to the Sixth Twente Workshop on Graphs and Combinatorial Optimization : Enschede, The Netherlands, 26-28 June, 1999 | |
Strengthening the closure concept in claw-free graphs | |
Sufficient conditions for hamiltonicity and traceability of K1,3-free graphs | |
Throughput of ADSL modems | |
Toughness and hamiltonicity in k-trees, 2001: | |
Toughness and longest cycles in 2-connected planar graphs | |
Trees are graceful if and only if trees with a perfect matching are strongly graceful | |
Treewidth of gridgraphs, planar graphs, and graphs with bounded degree | |
Unifying results on Hamiltonian claw-free graphs | |
The unique 4-regular graphs on 14 and 15 vertices with diameter 2 | |
Updated contributions to the Twente Workshop on Hamiltonian graph theory, April 6-10, 1992 | |
Various results on the toughness of graphs | |
WG 2008 | |
A Σ3 type condition for heavy cycles in weighted graphs |