PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Broersma, Hajo"

Author of the publication

copydeleteadd this publication to your clipboard
Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number.

, , , and . Discussiones Mathematicae Graph Theory, 29 (1): 143-162 (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Michael Hajok University of Stuttgart

 

Other publications of authors with the same name

A Generalization of AT-Free Graphs and a Generic Algorithm for Solving Triangulation Problems., , , and . Algorithmica, 32 (4): 594-610 (2002)On stability of the hamiltonian index under contractions and closures., , and . Journal of Graph Theory, 49 (2): 104-115 (2005)Sharp Upper Bounds on the Minimum Number of Components of 2-factors in Claw-free Graphs., , and . Graphs and Combinatorics, 25 (4): 427-460 (2009)Toughness in Graphs - A Survey., , and . Graphs and Combinatorics, 22 (1): 1-35 (2006)Subpancyclicity of line graphs and degree sums along paths., and . Discrete Applied Mathematics, 154 (9): 1453-1463 (2006)A PTAS for the minimum weight connected vertex cover P3 problem on unit disk graphs., , , and . Theor. Comput. Sci., (2015)Degree-preserving trees., , , , , , and . Networks, 35 (1): 26-39 (2000)Back to basics: Homogeneous representations of multi-rate synchronous dataflow graphs., , , and . MEMOCODE, page 35-46. IEEE, (2013)Max-Plus Algebraic Throughput Analysis of Synchronous Dataflow Graphs., , , and . EUROMICRO-SEAA, page 29-38. IEEE Computer Society, (2012)Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion., , , and . Discrete Applied Mathematics, 120 (1-3): 13-23 (2002)