{"id":"https://openalex.org/W1981227833","doi":"https://doi.org/10.1137/100800452","title":"On 3-Connected Graphs of Path-Width at Most Three","display_name":"On 3-Connected Graphs of Path-Width at Most Three","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W1981227833","doi":"https://doi.org/10.1137/100800452","mag":"1981227833"},"language":"en","primary_location":{"id":"doi:10.1137/100800452","is_oa":false,"landing_page_url":"https://doi.org/10.1137/100800452","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on 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/A5108454863","display_name":"Guoli Ding","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Guoli Ding","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5048357837","display_name":"Stan Dziobiak","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Stan Dziobiak","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5108454863"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.131,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.79930693,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"27","issue":"3","first_page":"1514","last_page":"1526"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","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"}},{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9944000244140625,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8407377004623413},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7921373844146729},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5906581282615662},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.5339722633361816},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4662769138813019},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45732417702674866},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.41041263937950134},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.22085189819335938},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.07217690348625183}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8407377004623413},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7921373844146729},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5906581282615662},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5339722633361816},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4662769138813019},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45732417702674866},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.41041263937950134},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.22085189819335938},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.07217690348625183},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/100800452","is_oa":false,"landing_page_url":"https://doi.org/10.1137/100800452","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:digitalcommons.lsu.edu:mathematics_pubs-1383","is_oa":false,"landing_page_url":"https://digitalcommons.lsu.edu/mathematics_pubs/384","pdf_url":null,"source":{"id":"https://openalex.org/S4210169993","display_name":"Civil War Book Review","issn_l":"1528-6592","issn":["1528-6592"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310315936","host_organization_name":"Louisiana State University","host_organization_lineage":["https://openalex.org/P4310315936"],"host_organization_lineage_names":["Louisiana State University"],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Faculty Publications","raw_type":"text"},{"id":"pmh:oai:repository.lsu.edu:mathematics_pubs-1383","is_oa":false,"landing_page_url":"https://repository.lsu.edu/mathematics_pubs/384","pdf_url":null,"source":{"id":"https://openalex.org/S4210169993","display_name":"Civil War Book Review","issn_l":"1528-6592","issn":["1528-6592"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310315936","host_organization_name":"Louisiana State University","host_organization_lineage":["https://openalex.org/P4310315936"],"host_organization_lineage_names":["Louisiana State University"],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Faculty Publications","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1973324808","https://openalex.org/W1991755800","https://openalex.org/W2005079828","https://openalex.org/W2026646714","https://openalex.org/W2029448190","https://openalex.org/W2033405938","https://openalex.org/W2040101882","https://openalex.org/W2060903706","https://openalex.org/W2067016370","https://openalex.org/W2071321409","https://openalex.org/W2073586409","https://openalex.org/W2094122366"],"related_works":["https://openalex.org/W2132921321","https://openalex.org/W2065006817","https://openalex.org/W2129550502","https://openalex.org/W2116465486","https://openalex.org/W2101572961","https://openalex.org/W1995629993","https://openalex.org/W2541062292","https://openalex.org/W1759713541","https://openalex.org/W2045633099","https://openalex.org/W2135694842"],"abstract_inverted_index":{"Tree-width":[0],"and":[1,11,34,60,96,138],"path-width":[2,35,82,122,151],"are":[3,39,51],"two":[4],"important":[5],"graph":[6],"parameters":[7],"introduced":[8],"by":[9,133,161,165],"Robertson":[10],"Seymour":[12],"in":[13,46,158],"their":[14,43],"famous":[15],"Graph":[16],"Minors":[17],"project.":[18],"For":[19],"a":[20,141],"fixed":[21],"positive":[22],"integer":[23],"$k$,":[24,33,38],"the":[25,71,77,117,159],"classes":[26],"of":[27,29,48,73,79,81,119,121,150],"graphs":[28,80,120,149],"tree-width":[30],"at":[31,36],"most":[32,37],"both":[40],"minor-closed.":[41],"However,":[42],"complete":[44],"characterizations":[45],"terms":[47],"excluded":[49,74,136,167],"minors":[50,75],"known":[52,69],"only":[53,134],"for":[54,58,61,65,76,147],"$k":[55,62,88,93,101],"\\leqslant":[56,63],"3$":[57],"tree-width,":[59],"2$":[64],"path-width.":[66],"It":[67],"is":[68,85],"that":[70,116],"number":[72],"class":[78,118,164],"$\\leqslant":[83,123,152],"k$":[84],"2":[86],"if":[87,92,100],"=":[89,94,102],"1$;":[90],"$110$":[91],"2$;":[95],"$\\geqslant":[97],"122$":[98],"million":[99],"3$.":[103,153],"Bar\u00e1t":[104],"et.":[105],"al.":[106],"[Studia":[107],"Sci.":[108],"Math.":[109],"Hungar.,":[110],"49":[111],"(2012),":[112],"pp.":[113],"211--222]":[114],"showed":[115],"2$,":[124],"restricted":[125],"to":[126],"its":[127],"2-connected":[128],"members,":[129],"can":[130],"be":[131,145],"characterized":[132],"three":[135],"minors,":[137],"asked":[139],"whether":[140],"similar":[142],"result":[143],"may":[144],"obtained":[146],"3-connected":[148],"We":[154],"answer":[155],"this":[156,163],"question":[157],"affirmative":[160],"characterizing":[162],"five":[166],"minors.":[168]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}