{"id":"https://openalex.org/W2095263228","doi":"https://doi.org/10.1016/s0012-365x(99)00231-9","title":"Tolerance intersection graphs on binary trees with constant tolerance 3","display_name":"Tolerance intersection graphs on binary trees with constant tolerance 3","publication_year":2000,"publication_date":"2000-03-01","ids":{"openalex":"https://openalex.org/W2095263228","doi":"https://doi.org/10.1016/s0012-365x(99)00231-9","mag":"2095263228"},"language":"en","primary_location":{"id":"doi:10.1016/s0012-365x(99)00231-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0012-365x(99)00231-9","pdf_url":null,"source":{"id":"https://openalex.org/S18902827","display_name":"Discrete Mathematics","issn_l":"0012-365X","issn":["0012-365X","1872-681X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008224159","display_name":"Robert E. Jamison","orcid":"https://orcid.org/0000-0001-6116-7662"},"institutions":[{"id":"https://openalex.org/I8078737","display_name":"Clemson University","ror":"https://ror.org/037s24f05","country_code":"US","type":"education","lineage":["https://openalex.org/I8078737"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert E. Jamison","raw_affiliation_strings":["Department of Mathematical Sciences, Clemson University, Clemson, SC 29634-1907, USA","Department of Mathematical Sciences Clemson University Clemson, SC 29634-1907, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Clemson University, Clemson, SC 29634-1907, USA","institution_ids":["https://openalex.org/I8078737"]},{"raw_affiliation_string":"Department of Mathematical Sciences Clemson University Clemson, SC 29634-1907, USA","institution_ids":["https://openalex.org/I8078737"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027984951","display_name":"Henry Martyn Mulder","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Henry Martyn Mulder","raw_affiliation_strings":["Econometrisch Instituut, Erasmus Universiteit, P.O. Box 1738, NL-3000 DR Rotterdam, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Econometrisch Instituut, Erasmus Universiteit, P.O. Box 1738, NL-3000 DR Rotterdam, The Netherlands","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5027984951"],"corresponding_institution_ids":[],"apc_list":{"value":3000,"currency":"USD","value_usd":3000},"apc_paid":null,"fwci":0.9369,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.77422452,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"215","issue":"1-3","first_page":"115","last_page":"131"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9882000088691711,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.9814000129699707,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8398337960243225},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8043642044067383},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.7419866919517517},{"id":"https://openalex.org/keywords/intersection-graph","display_name":"Intersection graph","score":0.6603578329086304},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.5485268235206604},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5453866720199585},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.5317909121513367},{"id":"https://openalex.org/keywords/block-graph","display_name":"Block graph","score":0.5036558508872986},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.4860113561153412},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.44733792543411255},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4376606047153473},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4335118532180786},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.270166277885437},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.19027253985404968},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.0814841091632843}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8398337960243225},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8043642044067383},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.7419866919517517},{"id":"https://openalex.org/C54540088","wikidata":"https://www.wikidata.org/wiki/Q3498041","display_name":"Intersection graph","level":4,"score":0.6603578329086304},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.5485268235206604},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5453866720199585},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.5317909121513367},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.5036558508872986},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.4860113561153412},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.44733792543411255},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4376606047153473},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4335118532180786},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.270166277885437},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.19027253985404968},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0814841091632843},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s0012-365x(99)00231-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0012-365x(99)00231-9","pdf_url":null,"source":{"id":"https://openalex.org/S18902827","display_name":"Discrete Mathematics","issn_l":"0012-365X","issn":["0012-365X","1872-681X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:pure.eur.nl:openaire_cris_publications/863251b3-7d69-44bd-bad3-b405b668f403","is_oa":false,"landing_page_url":"https://pure.eur.nl/en/publications/863251b3-7d69-44bd-bad3-b405b668f403","pdf_url":null,"source":{"id":"https://openalex.org/S4306401266","display_name":"EUR Research Repository (Erasmus University Rotterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I913958620","host_organization_name":"Erasmus University Rotterdam","host_organization_lineage":["https://openalex.org/I913958620"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Jamison, RE & Mulder, M 2000, 'Tolerance intersection graphs on binary trees with constant tolerance 3', Discrete Mathematics, vol. 215, pp. 115-131.","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1517921658","https://openalex.org/W1972937804","https://openalex.org/W1976489861","https://openalex.org/W1978452004","https://openalex.org/W1981303423","https://openalex.org/W2012200612","https://openalex.org/W2017793597","https://openalex.org/W2041910029","https://openalex.org/W2058048823"],"related_works":["https://openalex.org/W2500884709","https://openalex.org/W1986676437","https://openalex.org/W2153789027","https://openalex.org/W2028363955","https://openalex.org/W2143328773","https://openalex.org/W4288278989","https://openalex.org/W2113552471","https://openalex.org/W1546874952","https://openalex.org/W3162605084","https://openalex.org/W1981728803"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}