{"id":"https://openalex.org/W1936965644","doi":"https://doi.org/10.1002/jgt.3190030409","title":"A class of upper\u2010embeddable graphs","display_name":"A class of upper\u2010embeddable graphs","publication_year":1979,"publication_date":"1979-12-01","ids":{"openalex":"https://openalex.org/W1936965644","doi":"https://doi.org/10.1002/jgt.3190030409","mag":"1936965644"},"language":"en","primary_location":{"id":"doi:10.1002/jgt.3190030409","is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.3190030409","pdf_url":null,"source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Theory","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/A5110058236","display_name":"Fran\u00e7ois Jaeger","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"F. Jaeger","raw_affiliation_strings":["I.M.A.G Grenoble"],"affiliations":[{"raw_affiliation_string":"I.M.A.G Grenoble","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111824392","display_name":"Charles Payan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"C. Payan","raw_affiliation_strings":["I.M.A.G Grenoble"],"affiliations":[{"raw_affiliation_string":"I.M.A.G Grenoble","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090559105","display_name":"Nguyen Huy Xuong","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"N. H. Xuong","raw_affiliation_strings":["I.M.A.G Grenoble"],"affiliations":[{"raw_affiliation_string":"I.M.A.G Grenoble","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5110058236"],"corresponding_institution_ids":[],"apc_list":{"value":3760,"currency":"USD","value_usd":3760},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.08108108,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"3","issue":"4","first_page":"387","last_page":"391"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9991000294685364,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9991000294685364,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9975000023841858,"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/T11476","display_name":"Graph theory and applications","score":0.9926000237464905,"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/combinatorics","display_name":"Combinatorics","score":0.8384889960289001},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8282313346862793},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5784053802490234},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.566987156867981},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43941327929496765},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4282170534133911},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.42645126581192017},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.41111963987350464},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.3992641568183899},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.3562498092651367}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8384889960289001},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8282313346862793},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5784053802490234},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.566987156867981},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43941327929496765},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4282170534133911},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.42645126581192017},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.41111963987350464},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.3992641568183899},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.3562498092651367},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/jgt.3190030409","is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.3190030409","pdf_url":null,"source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W119745626","https://openalex.org/W1964406530","https://openalex.org/W1990733696","https://openalex.org/W2087811472","https://openalex.org/W2088320806","https://openalex.org/W2799004609","https://openalex.org/W4213214460"],"related_works":["https://openalex.org/W3139101777","https://openalex.org/W4385327816","https://openalex.org/W3160792420","https://openalex.org/W4287181997","https://openalex.org/W4220852510","https://openalex.org/W2886071965","https://openalex.org/W4385588236","https://openalex.org/W2083238533","https://openalex.org/W2061237693","https://openalex.org/W603403972"],"abstract_inverted_index":{"Abstract":[0],"In":[1],"this":[2],"paper,":[3],"we":[4],"prove":[5],"the":[6],"following":[7],"result:":[8],"Every":[9],"graph":[10],"obtained":[11],"by":[12],"connecting":[13],"(with":[14],"any":[15],"number":[16,27],"of":[17],"edges)":[18],"two":[19],"vertex\u2010disjoint":[20],"upper\u2010embeddable":[21],"graphs":[22,23],"with":[24],"even":[25],"Betti":[26],"is":[28],"upper\u2010embeddable.":[29]},"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}