Abstract
In this paper we introduce a new class of graphs which generalize both the tolerance and the trapezoid graphs, the multitolerance graphs. We show that the difference between the pathwidth and the treewidth of a multitolerance graph is at most one, and we develop an algorithm which solves the minimum fill-in problem for a multitolerance graph with a given representation in polynomial time. These results complement the recent results of Habib and Möhring [18, 25] about the treewidth and pathwidth of cocomparability graphs and graphs without asteroidal triples, and those of Kloks et al. [21] about the minimum fill-in problem.
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.
