Abstract
If an undirected graph is the intersection graph of a set of intervals of the real line, it is called an interval graph and the set of intervals is called an interval representation of the graph. An interval graph typically has many representations that differ in the order of the endpoints of the intervals along the line. This paper gives three methods for describing these differences and shows how these methods can be used to determine whether a graph has a representation satisfying various restrictions on the relative positions of the intervals. It concludes with an application of these results to the subject of interval counts of interval graphs.
Sign-in/Register to access full text options 
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.
