Tolerance graphs, and orders
From MaRDI portal
Publication:4242964
DOI<129::AID-JGT2>3.0.CO;2-M 10.1002/(SICI)1097-0118(199807)28:3<129::AID-JGT2>3.0.CO;2-MzbMath0921.05053OpenAlexW4230110633MaRDI QIDQ4242964
Publication date: 29 September 1999
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199807)28:3<129::aid-jgt2>3.0.co;2-m
Related Items (11)
A note on tolerance graph recognition ⋮ Recognizing simple-triangle graphs by restricted 2-chain subgraph cover ⋮ A recognition algorithm for simple-triangle graphs ⋮ On the intersection of tolerance and cocomparability graphs ⋮ An intersection model for multitolerance graphs: efficient algorithms and hierarchy ⋮ First-fit coloring of bounded tolerance graphs ⋮ Dimension-2 poset competition numbers and dimension-2 poset double competition numbers ⋮ A vertex ordering characterization of simple-triangle graphs ⋮ New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs ⋮ Two minimal forbidden subgraphs for double competition graphs of posets of dimension at most two ⋮ Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs
This page was built for publication: Tolerance graphs, and orders