{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:42:59Z","timestamp":1753893779682,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>Bound polysemy  is the property of any pair $(G_1, G_2)$ of graphs on a shared vertex set $V$ for which there exists a partial order on $V$ such that any pair of vertices has an upper bound precisely when the pair is an edge in $G_1$ and a lower bound precisely when it is an edge in $G_2$. We examine several special cases and prove a characterization of the bound polysemic pairs that illuminates a connection with the squared graphs.<\/jats:p>","DOI":"10.37236\/1521","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T02:03:01Z","timestamp":1578708181000},"source":"Crossref","is-referenced-by-count":2,"title":["Bound Graph Polysemy"],"prefix":"10.37236","volume":"7","author":[{"given":"Paul J.","family":"Tanenbaum","sequence":"first","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2000,8,15]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v7i1r43\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v7i1r43\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,18]],"date-time":"2020-01-18T05:22:14Z","timestamp":1579324934000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v7i1r43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,8,15]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2000,1,1]]}},"URL":"https:\/\/doi.org\/10.37236\/1521","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2000,8,15]]},"article-number":"R43"}}