Abstract
In this paper we introduce homogeneously orderable graphs which are a common generalization of distance-hereditary graphs, dually chordal graphs and homogeneous graphs. We present a characterization of the new class in terms of a tree structure of the closed neighbourhoods of homogeneous sets in 2-graphs which is closely related to the defining elimination ordering.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call