{"id":"https://openalex.org/W1982616365","doi":"https://doi.org/10.1016/s1571-0653(04)00101-5","title":"Long Paths Through Specified Vertices In 3-Connected Graphs","display_name":"Long Paths Through Specified Vertices In 3-Connected Graphs","publication_year":2002,"publication_date":"2002-07-01","ids":{"openalex":"https://openalex.org/W1982616365","doi":"https://doi.org/10.1016/s1571-0653(04)00101-5","mag":"1982616365"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0653(04)00101-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s1571-0653(04)00101-5","pdf_url":null,"source":{"id":"https://openalex.org/S902237881","display_name":"Electronic Notes in Discrete Mathematics","issn_l":"1571-0653","issn":["1571-0653"],"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":"Electronic Notes in 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/A5102009458","display_name":"Toshinori Sakai","orcid":null},"institutions":[{"id":"https://openalex.org/I1314466530","display_name":"Tokai University","ror":"https://ror.org/01p7qe739","country_code":"JP","type":"education","lineage":["https://openalex.org/I1314466530"]},{"id":"https://openalex.org/I4210136457","display_name":"Shibuya (Japan)","ror":"https://ror.org/03t1ztz45","country_code":"JP","type":"company","lineage":["https://openalex.org/I4210136457"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Toshinori Sakai","raw_affiliation_strings":["Research Institute of Education, Tokai University, 2-28-4 Tomigaya, Shibuya-ku, Tokyo 151-0063, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Research Institute of Education, Tokai University, 2-28-4 Tomigaya, Shibuya-ku, Tokyo 151-0063, Japan","institution_ids":["https://openalex.org/I1314466530","https://openalex.org/I4210136457"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5102009458"],"corresponding_institution_ids":["https://openalex.org/I1314466530","https://openalex.org/I4210136457"],"apc_list":{"value":3000,"currency":"USD","value_usd":3000},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10883823,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"11","issue":null,"first_page":"550","last_page":"561"},"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.9990000128746033,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"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.8953068256378174},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7350594401359558},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5406093597412109},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5207957625389099},{"id":"https://openalex.org/keywords/path-graph","display_name":"Path graph","score":0.5060338377952576},{"id":"https://openalex.org/keywords/connectivity","display_name":"Connectivity","score":0.4896736443042755},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4529605507850647},{"id":"https://openalex.org/keywords/induced-path","display_name":"Induced path","score":0.42807555198669434},{"id":"https://openalex.org/keywords/wheel-graph","display_name":"Wheel graph","score":0.42086294293403625},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.349021852016449},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.22267702221870422},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.18842589855194092},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.13078460097312927},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.07466304302215576},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.07219907641410828}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8953068256378174},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7350594401359558},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5406093597412109},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5207957625389099},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.5060338377952576},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.4896736443042755},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4529605507850647},{"id":"https://openalex.org/C58228413","wikidata":"https://www.wikidata.org/wiki/Q15704639","display_name":"Induced path","level":5,"score":0.42807555198669434},{"id":"https://openalex.org/C148364342","wikidata":"https://www.wikidata.org/wiki/Q948887","display_name":"Wheel graph","level":5,"score":0.42086294293403625},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.349021852016449},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.22267702221870422},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.18842589855194092},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.13078460097312927},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.07466304302215576},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.07219907641410828},{"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.1016/s1571-0653(04)00101-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s1571-0653(04)00101-5","pdf_url":null,"source":{"id":"https://openalex.org/S902237881","display_name":"Electronic Notes in Discrete Mathematics","issn_l":"1571-0653","issn":["1571-0653"],"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":"Electronic Notes in Discrete Mathematics","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":0,"referenced_works":[],"related_works":["https://openalex.org/W142613662","https://openalex.org/W1785360057","https://openalex.org/W2039832814","https://openalex.org/W2072516858","https://openalex.org/W2786830943","https://openalex.org/W4299976271","https://openalex.org/W2463313349","https://openalex.org/W2399451272","https://openalex.org/W2080337524","https://openalex.org/W1545635390"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}