( en | de | ru )

 

Disambiguation of "Bergold, Helena"

Author of the publication

copydeleteadd this publication to your clipboard
A semi-strong perfect digraph theorem.

, , , and . AKCE Int. J. Graphs Comb., 17 (3): 992-994 (2020)

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.

Sebastian Bergold

Wolfgang Bergold

Helmut Bergold

Stephanie Bergold

Friedrich Bergold

 

Other publications of authors with the same name

An Extension Theorem for Signotopes., , and . SoCG, volume 258 of LIPIcs, page 17:1-17:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Using SAT to study plane Hamiltonian substructures in simple drawings., , , and . CoRR, (2023)The Neighborhood Polynomial of Chordal Graphs., , and . CoRR, (2020)Autoparatopism stabilized colouring games on rook's graphs., , and . Electron. Notes Discret. Math., (2018)The Neighborhood Polynomial of Chordal Graphs., , and . Discret. Math. Theor. Comput. Sci., (2022)Well-Separation and Hyperplane Transversals in High Dimensions., , , , and . SWAT, volume 227 of LIPIcs, page 16:1-16:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)A semi-strong perfect digraph theorem., , , and . AKCE Int. J. Graphs Comb., 17 (3): 992-994 (2020)Finding hardness reductions automatically using SAT solvers., , and . CoRR, (2024)Topological Drawings Meet Classical Theorems from Convex Geometry., , , , and . GD, volume 12590 of Lecture Notes in Computer Science, page 281-294. Springer, (2020)Colorings of oriented planar graphs avoiding a monochromatic subgraph., , and . Discret. Appl. Math., (2022)