A set of vertices of a graph G is said to be decycling if its removal
le...
It is known that testing isomorphism of chordal graphs is as hard as the...
By a map we mean a 2-cell decomposition of a closed compact surface, i.e...
A graph is said to be distance-hereditary if the distance function in ev...
A graph is said to be circular-arc if the vertices can be associated wit...