Abstract
Wegner proved that a chordal graph is a proper interval graph if and only if it is claw-free, net-free and tent-free. We observe that in fact the characterization can be refined to say that a chordal graph is a proper interval graph if and only if it is claw-free, net-free and not a multiple of the tent. This observation implies that a chordal graph is a proper circular arc graph if and only if it is claw-free and net-free. A further implication of this result is that a chordal graph can be oriented as a local tournament - an oriented raph in which the predecessors as well as the successors of any vertex induce a tournament - if and only if it is claw-free and net-free.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
