| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Douglas Bauer, H. J. Broersma, J. van den Heuvel, Nathan Kahl, Edward F. Schmeichel |
Degree Sequences and the Existence of k-Factors.  |
Graphs and Combinatorics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | H. J. Broersma, Zdenek Ryjácek, Petr Vrána |
How Many Conjectures Can You Stand? A Survey. |
Graphs and Combinatorics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song |
Determining the chromatic number of triangle-free 2P3-free graphs in polynomial time. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song |
Updating the complexity status of coloring graphs without a fixed induced linear forest. |
Theor. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | MingChu Li, Xiaodong Chen, Hajo Broersma |
Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs. |
Journal of Graph Theory |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Petr A. Golovach, Viresh Patel |
Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width. |
IPEC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Daniël Paulusma |
Computing sharp 2-factors in claw-free graphs. |
J. Discrete Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Stefan S. Dantchev, Matthew Johnson 0002, Stefan Szeider |
Editorial. |
J. Discrete Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song |
Narrowing Down the Gap on the Complexity of Coloring Pk-Free Graphs. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song |
On Coloring Graphs without Induced Forests. |
ISAAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Bonsma, Hajo Broersma, Viresh Patel, Artem V. Pyatkin |
The Complexity Status of Problems Related to Sparsest Cuts. |
IWOCA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | H. J. Broersma, Jun Fujisawa, L. Marchal, Daniël Paulusma, A. N. M. Salman, Kiyoshi Yoshimoto |
lambda-backbone colorings along pairwise disjoint stars and matchings. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Matthew Johnson 0002, Daniël Paulusma |
Upper bounds and algorithms for parallel knock-out numbers. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Xueliang Li, Xiangmei Yao, Wenli Zhou, Hajo Broersma |
Complexity of conditional colorability of graphs. |
Appl. Math. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Daniël Paulusma, Kiyoshi Yoshimoto |
Sharp Upper Bounds on the Minimum Number of Components of 2-factors in Claw-free Graphs. |
Graphs and Combinatorics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Bert Marchal, Daniël Paulusma, A. N. M. Salman |
Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number. |
Discussiones Mathematicae Graph Theory |
2009 |
DBLP BibTeX RDF |
|
| 1 | Hajo Broersma, Stefan S. Dantchev, Matthew Johnson 0002, Stefan Szeider |
Editorial. |
J. Discrete Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma |
Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Dieter Kratsch, Gerhard J. Woeginger |
Fully Decomposable Split Graphs. |
IWOCA |
2009 |
DBLP DOI BibTeX RDF |
computational complexity, graph decomposition, integer partition |
| 1 | Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma |
Three Complexity Results on Coloring Pk-Free Graphs. |
IWOCA |
2009 |
DBLP DOI BibTeX RDF |
P k -free graph, computational complexity, graph coloring |
| 1 | MingChu Li, Liming Xiong, H. J. Broersma |
Connected even factors in claw-free graphs. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Matthew Johnson 0002, Daniël Paulusma, Iain A. Stewart |
The computational complexity of the parallel knock-out problem. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Gasper Fijavz, Tomás Kaiser, Roman Kuzel, Zdenek Ryjácek, Petr Vrána |
Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ligong Wang, Hajo Broersma, Cornelis Hoede, Xueliang Li, Georg Still |
Some families of integral graphs. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Agostino Capponi, Daniël Paulusma |
A New Algorithm for On-line Coloring Bipartite Graphs. |
SIAM J. Discrete Math. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Stefan S. Dantchev, Matthew Johnson 0002, Stefan Szeider |
Preface. |
J. Discrete Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Thomas Erlebach, Tom Friedetzky, Daniël Paulusma (eds.) |
Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers |
WG |
2008 |
DBLP BibTeX RDF |
|
| 1 | Hajo Broersma, Daniël Paulusma |
Computing Sharp 2-Factors in Claw-Free Graphs. |
MFCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | A. N. M. Salman, H. J. Broersma |
Path-kipas Ramsey numbers. |
Discrete Applied Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Daniël Paulusma, Kiyoshi Yoshimoto |
On components of 2-factors in claw-free graphs. |
Electronic Notes in Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Gasper Fijavz, Tomás Kaiser, Roman Kuzel, Zdenek Ryjácek, Petr Vrána |
Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks. |
Electronic Notes in Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Xueliang Li |
On the complexity of dominating set problems related to the minimum all-ones problem. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Liming Xiong, Kiyoshi Yoshimoto |
Toughness and hamiltonicity in k-trees. |
Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | A. N. M. Salman, Hajo Broersma |
On Ramsey numbers for paths versus wheels. |
Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Douglas Bauer, Hajo Broersma, Aurora Morgana, Edward F. Schmeichel |
Tutte sets in graphs I: Maximal tutte sets and D-graphs. |
Journal of Graph Theory |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Oleg V. Borodin, Hajo Broersma, Alexei N. Glebov, J. van den Heuvel |
A new upper bound on the cyclic chromatic number. |
Journal of Graph Theory |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger |
Backbone colorings for graphs: Tree and path backbones. |
Journal of Graph Theory |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ligong Wang, Hajo Broersma, Cornelis Hoede, Xueliang Li, Georg Still |
Integral trees of diameter 6. |
Discrete Applied Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Douglas Bauer, Hajo Broersma, Nathan Kahl, Aurora Morgana, Edward F. Schmeichel, T. Surowiec |
Tutte sets in graphs II: The complexity of finding maximum Tutte sets. |
Discrete Applied Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic, Gerhard J. Woeginger |
Eliminating graphs by means of parallel knock-out schemes. |
Discrete Applied Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Matthew Johnson 0002, Daniël Paulusma |
Upper Bounds and Algorithms for Parallel Knock-Out Numbers. |
SIROCCO |
2007 |
DBLP DOI BibTeX RDF |
parallel knock-out schemes, computational complexity, claw-free graphs |
| 1 | Hajo Broersma, Bert Marchal, Daniël Paulusma, A. N. M. Salman |
Improved Upper Bounds for lambda -Backbone Colorings Along Matchings and Stars. |
SOFSEM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger |
Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult. |
Algorithmica |
2006 |
DBLP DOI BibTeX RDF |
Computational complexity, Graph coloring, Planar graph, Graph partitioning, Forbidden subgraph |
| 1 | Douglas Bauer, Hajo Broersma, Edward F. Schmeichel |
Toughness in Graphs - A Survey. |
Graphs and Combinatorics |
2006 |
DBLP DOI BibTeX RDF |
Toughness, t-tough graph, Traceable graph, Circumference, k-factor, Triangle-free graph, Computational complexity, Factor, Planar graph, Chordal graph, Hamiltonian graph, Hamilton cycle |
| 1 | Stephan Brandt, Hajo Broersma, Reinhard Diestel, Matthias Kriesell |
Global Connectivity And Expansion: Long Cycles and Factors In f-Connected Graphs. |
Combinatorica |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C40, 05C45, 05C70, 05C38 |
| 1 | A. N. M. Salman, Hajo Broersma |
Path-fan Ramsey numbers. |
Discrete Applied Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Liming Xiong, Hajo Broersma |
Subpancyclicity of line graphs and degree sums along paths. |
Discrete Applied Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Stefan S. Dantchev, Matthew Johnson 0002, Stefan Szeider (eds.) |
Algorithms and Complexity in Durham 2006 - Proceedings of the Second ACiD Workshop, 18-20 September 2006, Durham, UK |
ACiD |
2006 |
DBLP BibTeX RDF |
|
| 1 | Hajo Broersma, Matthew Johnson 0002, Daniël Paulusma, Iain A. Stewart |
The Computational Complexity of the Parallel Knock-Out Problem. |
LATIN |
2006 |
DBLP DOI BibTeX RDF |
Parallel knock-out, computational complexity, graphs |
| 1 | Hajo Broersma, Agostino Capponi, Daniël Paulusma |
On-Line Coloring of H-Free Bipartite Graphs. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Liming Xiong, Zdenek Ryjácek, Hajo Broersma |
On stability of the hamiltonian index under contractions and closures. |
Journal of Graph Theory |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Matthew Johnson 0002, Stefan Szeider (eds.) |
Algorithms and Complexity in Durham 2005 - Proceedings of the First ACiD Workshop, 8-10 July 2005, Durham, UK |
ACiD |
2005 |
DBLP BibTeX RDF |
|
| 1 | A. N. M. Salman, H. J. Broersma |
The Ramsey Numbers of Paths Versus Kipases. |
Electronic Notes in Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger |
Radio Labeling with Preassigned Frequencies. |
SIAM Journal on Optimization |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Liming Xiong, Hajo Broersma, Xueliang Li, MingChu Li |
The hamiltonian index of a graph and its branch-bonds. |
Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Ulrich Faigle, Stefan Pickl, Hajo Broersma, Johann Hurink |
Preface: The 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization. |
Discrete Applied Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Daniël Paulusma, Gerard J. M. Smit, Frank Vlaardingerbroek, Gerhard J. Woeginger |
The Computational Complexity of the Minimum Weight Processor Assignment Problem. |
WG |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Fedor V. Fomin, Gerhard J. Woeginger |
Parallel Knock-Out Schemes in Networks. |
MFCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | A. N. M. Salman, Hajo Broersma |
The Ramsey Numbers of Paths Versus Kipases. |
CTW |
2004 |
DBLP BibTeX RDF |
|
| 1 | A. N. M. Salman, H. J. Broersma |
The Ramsey Numbers of Paths Versus Fans. |
Electronic Notes in Discrete Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Ulrich Faigle, Johann Hurink, Stefan Pickl, Gerhard J. Woeginger |
Preface: Volume 13. |
Electronic Notes in Discrete Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | A. N. M. Salman, Hajo Broersma, Edy Tri Baskoro |
Spanning 2-Connected Subgraphs in Alphabet Graphs, Special Classes of Grid Graphs. |
Journal of Automata, Languages and Combinatorics |
2003 |
DBLP BibTeX RDF |
|
| 1 | Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger |
Backbone Colorings for Networks. |
WG |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuanqing Guo, Gerard J. M. Smit, Hajo Broersma, Michèl A. J. Rosien, Paul M. Heysters |
Mapping Applications to a Coarse Grain Reconfigurable System. |
Asia-Pacific Computer Systems Architecture Conference |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuanqing Guo, Gerard J. M. Smit, Hajo Broersma, Paul M. Heysters |
Template Generation and Selection Algorithms. |
IWSOC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma |
A General Framework for Coloring Problems: Old Results, New Results, and Open Problems. |
IJCCGGT |
2003 |
DBLP DOI BibTeX RDF |
computational complexity, graph coloring, planar graph, graph partitioning, forbidden subgraph |
| 1 | Surahmat, Edy Tri Baskoro, Saladin Uttunggadewa, Hajo Broersma |
An Upper Bound for the Ramsey Number of a Cycle of Length Four Versus Wheels. |
IJCCGGT |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuanqing Guo, Gerard J. M. Smit, Hajo Broersma, Paul M. Heysters |
A graph covering algorithm for a coarse grain reconfigurable system. |
LCTES |
2003 |
DBLP DOI BibTeX RDF |
template generation, compiler, reconfigurable system |
| 1 | Douglas Bauer, Hajo Broersma, Edward F. Schmeichel |
More Progress on Tough Graphs - The Y2K Report. |
Electronic Notes in Discrete Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Liming Xiong, Hajo Broersma, Cornelis Hoede, Xueliang Li |
Degree sums and subpancyclicity in line graphs. |
Discrete Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma |
On some intriguing problems in hamiltonian graph theory--a survey. |
Discrete Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller |
A Generalization of AT-Free Graphs and a Generic Algorithm for Solving Triangulation Problems. |
Algorithmica |
2002 |
DBLP DOI BibTeX RDF |
Asteroidal triple, Minimum fill-in, Vertex ranking, Algorithm, Complexity, Graph, Treewidth |
| 1 | Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger |
More About Subcolorings. |
Computing |
2002 |
DBLP DOI BibTeX RDF |
AMS Subject Classifications: 05C15, 05C17, 05C85 |
| 1 | Shenggui Zhang, Hajo Broersma, Xueliang Li, Ligong Wang |
A Fan Type Condition For Heavy Cycles in Weighted Graphs. |
Graphs and Combinatorics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Liming Xiong |
A note on minimum degree conditions for supereulerian graphs. |
Discrete Applied Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Douglas Bauer, Hajo Broersma, Aurora Morgana, Edward F. Schmeichel |
Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion. |
Discrete Applied Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Xueliang Li |
Some approaches to a conjecture on short cycles in digraphs. |
Discrete Applied Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger |
More about Subcolorings. |
WG |
2002 |
DBLP DOI BibTeX RDF |
subcoloring, special graph classes, computational complexity, graph coloring, polynomial time algorithm |
| 1 | Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger |
Radio Labeling with Pre-assigned Frequencies. |
ESA |
2002 |
DBLP DOI BibTeX RDF |
Radio labeling, k-colorling, computational complexity, approximation algorithm, graph algorithms, frequency assignment, cograph |
| 1 | Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger |
Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous. |
SWAT |
2002 |
DBLP DOI BibTeX RDF |
computational complexity, graph coloring, planar graph, graph partitioning, forbidden subgraph |
| 1 | Xueliang Li, Shenggui Zhang, Hajo Broersma |
Paths and Cycles in Colored Graphs. |
Electronic Notes in Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Ulrich Faigle, Johann Hurink, Stefan Pickl |
Preface: Volume 8. |
Electronic Notes in Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Zdenek Ryjácek |
Strengthening the closure concept in claw-free graphs. |
Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Shenggui Zhang, Xueliang Li, Hajo Broersma |
Heavy paths and cycles in weighted graphs. |
Discrete Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Otto R. Koppius, Hilde Tuinstra, Andreas Huck, Ton Kloks, Dieter Kratsch, Haiko Müller |
Degree-preserving trees. |
Networks |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Zdenek Ryjácek, Ingo Schiermeyer |
Closure Concepts: A Survey. |
Graphs and Combinatorics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Douglas Bauer, Hajo Broersma, Henk Jan Veldman |
Not Every 2-tough Graph Is Hamiltonian. |
Discrete Applied Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Elias Dahlhaus, Ton Kloks |
A Linear Time Algorithm for Minimum Fill-in and Treewidth for Distance Hereditary Graphs. |
Discrete Applied Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Erik Engbers, Huib Trommel |
Various results on the toughness of graphs. |
Networks |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller |
Independent Sets in Asteroidal Triple-Free Graphs. |
SIAM J. Discrete Math. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Cornelis Hoede |
Another equivalent of the graceful tree conjecture. |
Ars Comb. |
1999 |
DBLP BibTeX RDF |
|
| 1 | Hajo Broersma, Huib Trommel |
Closure concepts for claw-free graphs. |
Discrete Mathematics |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller |
A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking. |
WG |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Andreas Huck, Ton Kloks, Otto R. Koppius, Dieter Kratsch, Haiko Müller, Hilde Tuinstra |
Degree-Preserving Forests. |
MFCS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | H. J. Broersma, Zdenek Ryjácek, Ingo Schiermeyer |
Dirac's minimum degree condition restricted to claws. |
Discrete Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | H. J. Broersma |
A note on the minimum size of a vertex pancyclic graph. |
Discrete Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Böhme, Hajo Broersma, F. Göbel, Alexandr V. Kostochka, Michael Stiebitz |
Spanning trees with pairwise nonadjacent endvertices. |
Discrete Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Hao Li, Jianping Li, Feng Tian, Henk Jan Veldman |
Cycles through subsets with large degree sums. |
Discrete Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Elias Dahlhaus, Ton Kloks |
Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs. |
WG |
1997 |
DBLP DOI BibTeX RDF |
MSC 68R10 |
| 1 | Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller |
Independent Sets in Asteroidal Triple-Free Graphs. |
ICALP |
1997 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")