Tolerance graphs, and orders
From MaRDI portal
Publication:4242964
DOI10.1002/(SICI)1097-0118(199807)28:3%3C129::AID-JGT2%3E3.0.CO;2-MzbMATH Open0921.05053OpenAlexW4230110633MaRDI QIDQ4242964FDOQ4242964
Publication date: 29 September 1999
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199807)28:3%3C129::aid-jgt2%3E3.0.co;2-m
Recommendations
Cited In (16)
- First-fit coloring of bounded tolerance graphs
- Title not available (Why is that?)
- On a problem concerning tolerance graphs
- A recognition algorithm for simple-triangle graphs
- Tolerance graphs
- On the intersection of tolerance and cocomparability graphs
- Two minimal forbidden subgraphs for double competition graphs of posets of dimension at most two
- Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
- An intersection model for multitolerance graphs: efficient algorithms and hierarchy
- New geometric representations and domination problems on tolerance and multitolerance graphs
- Title not available (Why is that?)
- Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs
- A vertex ordering characterization of simple-triangle graphs
- Tolerance orders and bipartite unit tolerance graphs
- A note on tolerance graph recognition
- Recognizing simple-triangle graphs by restricted 2-chain subgraph cover
This page was built for publication: Tolerance graphs, and orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4242964)