{"id":"https://openalex.org/W4240889454","doi":"https://doi.org/10.1002/jgt.3190130406","title":"Path graphs","display_name":"Path graphs","publication_year":1989,"publication_date":"1989-09-01","ids":{"openalex":"https://openalex.org/W4240889454","doi":"https://doi.org/10.1002/jgt.3190130406"},"language":"en","primary_location":{"id":"doi:10.1002/jgt.3190130406","is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.3190130406","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":true,"oa_status":"green","oa_url":"https://ris.utwente.nl/ws/files/17427506/Broersma89path.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068613759","display_name":"Hajo Broersma","orcid":"https://orcid.org/0000-0002-4678-3210"},"institutions":[{"id":"https://openalex.org/I94624287","display_name":"University of Twente","ror":"https://ror.org/006hf6230","country_code":"NL","type":"education","lineage":["https://openalex.org/I94624287"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"H. J. Broersma","raw_affiliation_strings":["Faculty of Applied Mathematics University of Twente Enschede, the Netherlands"],"affiliations":[{"raw_affiliation_string":"Faculty of Applied Mathematics University of Twente Enschede, the Netherlands","institution_ids":["https://openalex.org/I94624287"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112301604","display_name":"C. Hoede","orcid":null},"institutions":[{"id":"https://openalex.org/I94624287","display_name":"University of Twente","ror":"https://ror.org/006hf6230","country_code":"NL","type":"education","lineage":["https://openalex.org/I94624287"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"C. Hoede","raw_affiliation_strings":["Faculty of Applied Mathematics University of Twente Enschede, the Netherlands"],"affiliations":[{"raw_affiliation_string":"Faculty of Applied Mathematics University of Twente Enschede, the Netherlands","institution_ids":["https://openalex.org/I94624287"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5068613759"],"corresponding_institution_ids":["https://openalex.org/I94624287"],"apc_list":{"value":3760,"currency":"USD","value_usd":3760},"apc_paid":null,"fwci":0.4784,"has_fulltext":true,"cited_by_count":36,"citation_normalized_percentile":{"value":0.705807,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"13","issue":"4","first_page":"427","last_page":"444"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9860000014305115,"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.9860000014305115,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9222000241279602,"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.9143999814987183,"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.8549526929855347},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7764154076576233},{"id":"https://openalex.org/keywords/induced-path","display_name":"Induced path","score":0.5921772718429565},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.556912899017334},{"id":"https://openalex.org/keywords/pancyclic-graph","display_name":"Pancyclic graph","score":0.5109407305717468},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49467870593070984},{"id":"https://openalex.org/keywords/wheel-graph","display_name":"Wheel graph","score":0.49392586946487427},{"id":"https://openalex.org/keywords/path-graph","display_name":"Path graph","score":0.47941917181015015},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.4452124536037445},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.4383244812488556},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.432006299495697},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4304601550102234},{"id":"https://openalex.org/keywords/block-graph","display_name":"Block graph","score":0.42778468132019043},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.4143822193145752},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.38748252391815186},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.34517902135849}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8549526929855347},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7764154076576233},{"id":"https://openalex.org/C58228413","wikidata":"https://www.wikidata.org/wiki/Q15704639","display_name":"Induced path","level":5,"score":0.5921772718429565},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.556912899017334},{"id":"https://openalex.org/C166911692","wikidata":"https://www.wikidata.org/wiki/Q7130424","display_name":"Pancyclic graph","level":5,"score":0.5109407305717468},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49467870593070984},{"id":"https://openalex.org/C148364342","wikidata":"https://www.wikidata.org/wiki/Q948887","display_name":"Wheel graph","level":5,"score":0.49392586946487427},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.47941917181015015},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.4452124536037445},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.4383244812488556},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.432006299495697},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4304601550102234},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.42778468132019043},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.4143822193145752},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.38748252391815186},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.34517902135849}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1002/jgt.3190130406","is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.3190130406","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"},{"id":"pmh:oai:ris.utwente.nl:publications/d4dd83f2-54b0-4785-a19a-fd1d8a71a6a4","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/d4dd83f2-54b0-4785-a19a-fd1d8a71a6a4","pdf_url":"https://ris.utwente.nl/ws/files/17427506/Broersma89path.pdf","source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Broersma, H J & Hoede, C 1989, 'Path graphs', Journal of graph theory, vol. 13, no. 4, pp. 427-444. https://doi.org/10.1002/jgt.3190130406","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:ut:oai:ris.utwente.nl:publications/b1caec77-20c0-429d-a254-1a7f8f0cc9a4","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/path-graphs(b1caec77-20c0-429d-a254-1a7f8f0cc9a4).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of graph theory, 13(4), 427 - 444","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:ris.utwente.nl:publications/d4dd83f2-54b0-4785-a19a-fd1d8a71a6a4","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/d4dd83f2-54b0-4785-a19a-fd1d8a71a6a4","pdf_url":"https://ris.utwente.nl/ws/files/17427506/Broersma89path.pdf","source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Broersma, H J & Hoede, C 1989, 'Path graphs', Journal of graph theory, vol. 13, no. 4, pp. 427-444. https://doi.org/10.1002/jgt.3190130406","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4240889454.pdf","grobid_xml":"https://content.openalex.org/works/W4240889454.grobid-xml"},"referenced_works_count":4,"referenced_works":["https://openalex.org/W1985061810","https://openalex.org/W2095107575","https://openalex.org/W4213214460","https://openalex.org/W4231597948"],"related_works":["https://openalex.org/W142613662","https://openalex.org/W1785360057","https://openalex.org/W2072516858","https://openalex.org/W2069626737","https://openalex.org/W1595412293","https://openalex.org/W1545635390","https://openalex.org/W2399451272","https://openalex.org/W2463313349","https://openalex.org/W2080337524","https://openalex.org/W2171049078"],"abstract_inverted_index":{"Abstract":[0],"The":[1,15],"concept":[2],"of":[3,11,23],"a":[4,12,24,52,57],"line":[5],"graph":[6,17,25],"is":[7,27],"generalized":[8],"to":[9],"that":[10],"path":[13,16,53],"graph.":[14],"P":[18,33,47,54,62,79],"k":[19,34,48,60],"(":[20],"G":[21,26,36,50],")":[22],"obtained":[28],"by":[29,37],"representing":[30],"the":[31,44],"paths":[32,46],"in":[35,49],"vertices":[38,42],"and":[39,67,71,74],"joining":[40],"two":[41],"whenever":[43],"corresponding":[45],"form":[51],"k+1":[55],"or":[56],"cycle":[58],"C":[59],".":[61],"3":[63,80],"\u2010graphs":[64,81],"are":[65,82],"characterized":[66],"investigated":[68],"on":[69],"isomorphism":[70],"traversability.":[72],"Trees":[73],"unicyclic":[75],"graphs":[76],"with":[77],"hamiltonian":[78],"characterized.":[83]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2022-05-12T00:00:00"}