{"id":"https://openalex.org/W2090199268","doi":"https://doi.org/10.1002/jgt.3190140610","title":"Trees and unicyclic graphs with hamiltonian path graphs","display_name":"Trees and unicyclic graphs with hamiltonian path graphs","publication_year":1990,"publication_date":"1990-12-01","ids":{"openalex":"https://openalex.org/W2090199268","doi":"https://doi.org/10.1002/jgt.3190140610","mag":"2090199268"},"language":"en","primary_location":{"id":"doi:10.1002/jgt.3190140610","is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.3190140610","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/A5101185302","display_name":"Xingxing Yu","orcid":null},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Xingxing Yu","raw_affiliation_strings":["School of Mathematics Georgia Institute of Technology, Atlanta, Georgia 30332","School of Mathematics, Georgia Institute of Technology, Atlanta, Georgia, 30332"],"affiliations":[{"raw_affiliation_string":"School of Mathematics Georgia Institute of Technology, Atlanta, Georgia 30332","institution_ids":["https://openalex.org/I130701444"]},{"raw_affiliation_string":"School of Mathematics, Georgia Institute of Technology, Atlanta, Georgia, 30332","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5101185302"],"corresponding_institution_ids":["https://openalex.org/I130701444"],"apc_list":{"value":3760,"currency":"USD","value_usd":3760},"apc_paid":null,"fwci":0.4806,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.64928383,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"14","issue":"6","first_page":"705","last_page":"708"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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.9997000098228455,"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.9995999932289124,"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"}},{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9980999827384949,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8222993612289429},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7906827926635742},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.5710843801498413},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.541205644607544},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.5120609402656555},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.48799484968185425},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.4630088806152344},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44545841217041016},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.425920695066452},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.35116809606552124},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1679631471633911},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.10820254683494568}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8222993612289429},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7906827926635742},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.5710843801498413},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.541205644607544},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.5120609402656555},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.48799484968185425},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.4630088806152344},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44545841217041016},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.425920695066452},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.35116809606552124},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1679631471633911},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.10820254683494568},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/jgt.3190140610","is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.3190140610","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":2,"referenced_works":["https://openalex.org/W1484040084","https://openalex.org/W4240889454"],"related_works":["https://openalex.org/W2157783000","https://openalex.org/W4287117052","https://openalex.org/W4206705200","https://openalex.org/W2028363955","https://openalex.org/W4283803822","https://openalex.org/W2016277208","https://openalex.org/W1964113132","https://openalex.org/W2183941833","https://openalex.org/W2113292309","https://openalex.org/W1577883397"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"prove":[2],"two":[3],"conjectures":[4],"of":[5,12],"Broersma":[6],"and":[7,14],"Hoede":[8],"about":[9],"path":[10],"graphs":[11],"trees":[13],"unicyclic":[15],"graphs.":[16]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}