{"id":"https://openalex.org/W2073695625","doi":"https://doi.org/10.1017/s0963548300002170","title":"Smallest Sets of Longest Paths with Empty Intersection","display_name":"Smallest Sets of Longest Paths with Empty Intersection","publication_year":1996,"publication_date":"1996-12-01","ids":{"openalex":"https://openalex.org/W2073695625","doi":"https://doi.org/10.1017/s0963548300002170","mag":"2073695625"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548300002170","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548300002170","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","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/A5000504364","display_name":"Zdzis\u0142aw Skupie\u0144","orcid":null},"institutions":[{"id":"https://openalex.org/I46305939","display_name":"University of Zielona G\u00f3ra","ror":"https://ror.org/04fzm7v55","country_code":"PL","type":"education","lineage":["https://openalex.org/I46305939"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Z. Skupie\u0144","raw_affiliation_strings":["Technical University, WSI, Zielona G\u00f3ra, Poland"],"affiliations":[{"raw_affiliation_string":"Technical University, WSI, Zielona G\u00f3ra, Poland","institution_ids":["https://openalex.org/I46305939"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5000504364"],"corresponding_institution_ids":["https://openalex.org/I46305939"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.20336087,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"5","issue":"4","first_page":"429","last_page":"436"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9883000254631042,"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.9883000254631042,"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/T12923","display_name":"Digital Image Processing Techniques","score":0.9771000146865845,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9695000052452087,"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/combinatorics","display_name":"Combinatorics","score":0.8449128866195679},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.6373235583305359},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6286142468452454},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5635492205619812},{"id":"https://openalex.org/keywords/intersection-graph","display_name":"Intersection graph","score":0.5441480875015259},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5268073081970215},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.41115450859069824},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38207975029945374},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23000001907348633},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.14580821990966797},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.07435792684555054},{"id":"https://openalex.org/keywords/cartography","display_name":"Cartography","score":0.04154685139656067}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8449128866195679},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.6373235583305359},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6286142468452454},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5635492205619812},{"id":"https://openalex.org/C54540088","wikidata":"https://www.wikidata.org/wiki/Q3498041","display_name":"Intersection graph","level":4,"score":0.5441480875015259},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5268073081970215},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.41115450859069824},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38207975029945374},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23000001907348633},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.14580821990966797},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.07435792684555054},{"id":"https://openalex.org/C58640448","wikidata":"https://www.wikidata.org/wiki/Q42515","display_name":"Cartography","level":1,"score":0.04154685139656067},{"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.1017/s0963548300002170","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548300002170","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W62558605","https://openalex.org/W1566493102","https://openalex.org/W1585223727","https://openalex.org/W2040062736","https://openalex.org/W2531095544","https://openalex.org/W4247549312","https://openalex.org/W6660285111"],"related_works":["https://openalex.org/W2348909947","https://openalex.org/W4292672442","https://openalex.org/W2362101859","https://openalex.org/W2791431590","https://openalex.org/W2941610985","https://openalex.org/W4235810826","https://openalex.org/W2350688482","https://openalex.org/W1893408579","https://openalex.org/W2953260685","https://openalex.org/W2362473619"],"abstract_inverted_index":{"It":[0],"is":[1,11,65],"shown":[2],"that,":[3],"for":[4],"every":[5],"integer":[6],"v":[7,18,26],"<":[8],"7,":[9],"there":[10],"a":[12,32],"connected":[13,37],"graph":[14,58],"in":[15,34],"which":[16],"some":[17],"longest":[19,29,46,60],"paths":[20,30,47,61],"have":[21,31,62],"empty":[22,51,63],"intersection,":[23],"but":[24],"any":[25],"\u2013":[27],"1":[28],"vertex":[33],"common.":[35],"Moreover,":[36],"graphs":[38],"having":[39],"seven":[40],"or":[41],"five":[42],"minimal":[43],"sets":[44],"of":[45],"(longest":[48],"cycles)":[49],"with":[50],"intersection":[52,64],"are":[53],"presented.":[54],"A":[55],"26-vertex":[56],"2-connected":[57],"whose":[59],"exhibited.":[66]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}