Narrow search
Showing 1 - 10 of 30
Cover Image
Algorithms for minimum weighted colouring of perfectly ordered, comparability, triangulated, and clique separable graphs
Hoàng, Chinh T. - 1990
Persistent link: https://www.econbiz.de/10000798153
Cover Image
Efficient maximal cubic graph cuts : (extended abstract)
Loebl, Martin - 1990
Persistent link: https://www.econbiz.de/10000808995
Cover Image
Almost all Berge graphs are perfect
Prömel, Hans Jürgen; Steger, Angelika - 1991
Persistent link: https://www.econbiz.de/10000821427
Cover Image
Recognition and optimization algorithms for co-triangulated graphs
Hoàng, Chinh T. - 1990
Persistent link: https://www.econbiz.de/10000795060
Cover Image
The asymptotic structure of H-free graphs
Prömel, Hans Jürgen; Steger, Angelika - 1991
Persistent link: https://www.econbiz.de/10000828741
Cover Image
The maximum size of 4- and 6-cycle free bipartite graphs on m,n vertices
DeCaen, D. - 1991
Persistent link: https://www.econbiz.de/10000828742
Cover Image
Some properties of minimal imperfect graphs
Hoàng, Chinh T. - 1991
Persistent link: https://www.econbiz.de/10000832840
Cover Image
On ordered graphs and graph orderings
Nešetřil, Jaroslav - 1991
Persistent link: https://www.econbiz.de/10000832844
Cover Image
Which claw-free graphs are perfectly orderable?
Chvátal, Vašek - 1990
Persistent link: https://www.econbiz.de/10000801213
Cover Image
A parallel algorithm for minimum weighted colouring of triangulated graphs
Hoàng, Chinh T. - 1990
Persistent link: https://www.econbiz.de/10000801218