( en | de | ru )

 

Disambiguation of "Broersma, Hajo"

Author of the publication

copydeleteadd this publication to your clipboard
Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous.

, , , and . SWAT, volume 2368 of Lecture Notes in Computer Science, page 160-169. Springer, (2002)

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.

Alain Hajo

Karl Hajowsky

Naziha Hajo

Alexandra Hajok

Iván Hajós

 

Other publications of authors with the same name

Computability and Complexity of Unconventional Computing Devices., , and . CoRR, (2017)An Upper Bound for the Ramsey Number of a Cycle of Length Four Versus Wheels., , , and . IJCCGGT, volume 3330 of Lecture Notes in Computer Science, page 181-184. Springer, (2003)PATHS AND CYCLES IN COLORED GRAPHS, , and . Electronic Notes in Discrete Mathematics, (May 2001)A new upper bound on the cyclic chromatic number., , , and . J. Graph Theory, 54 (1): 58-72 (2007)Closing the Gap on Path-Kipas Ramsey Numbers., , , , and . Electron. J. Comb., 22 (3): 3 (2015)Radio Labeling with Pre-assigned Frequencies., , , , and . ESA, volume 2461 of Lecture Notes in Computer Science, page 211-222. Springer, (2002)Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs., , and . WG, volume 1335 of Lecture Notes in Computer Science, page 109-117. Springer, (1997)Computational Matter: Evolving Computational Solutions in Materials., and . GECCO (Companion), page 769-770. ACM, (2015)Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number., , , and . Discuss. Math. Graph Theory, 29 (1): 143-162 (2009)Removable edges on a Hamilton cycle or outside a cycle in a 4-connected graph., , , and . Discuss. Math. Graph Theory, 41 (2): 559-587 (2021)