{"docId":398,"paperId":398,"url":"https:\/\/dmtcs.episciences.org\/398","doi":"10.46298\/dmtcs.398","journalName":"Discrete Mathematics & Theoretical Computer Science","issn":"","eissn":"1365-8050","volume":[{"vid":81,"name":"Vol. 9 no. 1"}],"section":[{"sid":16,"title":"Graph and Algorithms","description":[]}],"repositoryName":"Hal","repositoryIdentifier":"hal-00966500","repositoryVersion":1,"repositoryLink":"https:\/\/hal.science\/hal-00966500v1","dateSubmitted":"2015-03-26 16:19:28","dateAccepted":"2015-06-09 14:46:33","datePublished":"2007-01-01 08:00:00","titles":{"en":"Tribes of cubic partial cubes"},"authors":["Klav\u017ear, Sandi","Shpectorov, Sergey"],"abstracts":{"0":"Graphs and Algorithms","en":"Partial cubes are graphs isometrically embeddable into hypercubes. Three infinite families and a few sporadic examples of cubic partial cubes are known. The concept of a tribe is introduced as means to systematize the known examples and establish relations among them. Efficient methods of computation of tribes are developed and several concrete tribes, that include known, as well as new cubic partial cubes, are computed by hand and with the use of a computer."},"keywords":["[INFO.INFO-DM] Computer Science [cs]\/Discrete Mathematics [cs.DM]"]}