On characterizing proper max-point-tolerance graphs
From MaRDI portal
Publication:6152618
DOI10.1080/09728600.2023.2245430arXiv2002.01349OpenAlexW3005349926MaRDI QIDQ6152618
Publication date: 12 March 2024
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.01349
Structural characterization of families of graphs (05C75) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Unnamed Item
- Unnamed Item
- Max point-tolerance graphs
- Adjacency matrices of probe interval graphs
- A short proof that `proper = unit'
- Algorithmic graph theory and perfect graphs
- Incidence matrices and interval graphs
- Representation of a finite graph by a set of intervals on the real line
- Max-tolerance graphs as intersection graphs
- Interval digraphs: An analogue of interval graphs
- Asteroidal Triple-Free Graphs
- On central max-point-tolerance graphs
- (c-)AND: A new graph model
- Circular‐Arc Bigraphs and Its Subclasses
This page was built for publication: On characterizing proper max-point-tolerance graphs