On the Intersection of Tolerance and Cocomparability Graphs

It has been conjectured by Golumbic and Monma in 1984 that the intersection of tolerance and cocomparability graphs coincides with bounded tolerance graphs. Since cocomparability graphs can be efficiently recognized, a positive answer to this conjecture in the general case would enable us to efficiently distinguish between tolerance and bounded tolerance graphs, although it is NP-complete to recognize each of these classes of graphs separately. The conjecture has been proved under some

• Type: Journal
• Year: 2010
• Where: ISAAC
• Authors: George B. Mertzios, Shmuel Zaks
• Keywords: Algorithms, Conjecture, ISAAC 2010, Tolerance, Tolerance Graph