activity
20122026
most citedPolynomial-time Algorithms for Weighted Efficient Domination Problems in AT-free Graphs and Dually Chordal Graphs

31 citations · 31 across the 7 of their papers we have counts for

collaborators
Showing 2012 · cs.DMShow all

1 paper · 2 filters

cs.DM2012

3-Colourability of Dually Chordal Graphs in Linear Time

Arne Leitert

A graph G is dually chordal if there is a spanning tree T of G such that any maximal clique of G induces a subtree in T. This paper investigates the Colourability problem on dually…