{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T17:45:45Z","timestamp":1781372745702,"version":"3.54.1"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>We give an algorithmic computation for the height of Kauffman's clock lattice obtained from a knot diagram with two adjacent regions starred and without crossing information specified. We show that this lattice is more familiarly the graph\u00a0of perfect matchings of a bipartite graph\u00a0obtained from the knot diagram by overlaying the two dual Tait graphs\u00a0of the knot diagram. Furthermore we prove structural properties of the bipartite graph in general. This setting also makes evident applications to Chebyshev or harmonic knots, whose related bipartite graph is the popular grid graph, and to discrete Morse functions.<\/jats:p>","DOI":"10.37236\/3395","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T00:52:38Z","timestamp":1578703958000},"source":"Crossref","is-referenced-by-count":8,"title":["Kauffman's Clock Lattice as a Graph of Perfect Matchings: a Formula for its Height"],"prefix":"10.37236","volume":"21","author":[{"given":"Moshe","family":"Cohen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mina","family":"Teicher","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"23455","published-online":{"date-parts":[[2014,11,13]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v21i4p31\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v21i4p31\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T10:40:36Z","timestamp":1579257636000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v21i4p31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,13]]},"references-count":0,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2014,10,2]]}},"URL":"https:\/\/doi.org\/10.37236\/3395","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,13]]},"article-number":"P4.31"}}