{"id":"https://openalex.org/W2163708037","doi":"https://doi.org/10.1016/0012-365x(83)90165-6","title":"Existence of dominating cycles and paths","display_name":"Existence of dominating cycles and paths","publication_year":1983,"publication_date":"1983-01-01","ids":{"openalex":"https://openalex.org/W2163708037","doi":"https://doi.org/10.1016/0012-365x(83)90165-6","mag":"2163708037"},"language":"en","primary_location":{"id":"doi:10.1016/0012-365x(83)90165-6","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0012-365x(83)90165-6","pdf_url":null,"source":{"id":"https://openalex.org/S18902827","display_name":"Discrete Mathematics","issn_l":"0012-365X","issn":["0012-365X","1872-681X"],"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":"Discrete Mathematics","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/6485757/Veldman83existence.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054877040","display_name":"H.J. Veldman","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":true,"raw_author_name":"H.J. Veldman","raw_affiliation_strings":["Department of Applied Mathematics, Twente University of Technology, Enschede, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics, Twente University of Technology, Enschede, The Netherlands","institution_ids":["https://openalex.org/I94624287"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5054877040"],"corresponding_institution_ids":["https://openalex.org/I94624287"],"apc_list":{"value":3000,"currency":"USD","value_usd":3000},"apc_paid":null,"fwci":1.7014,"has_fulltext":true,"cited_by_count":37,"citation_normalized_percentile":{"value":0.85398139,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"43","issue":"2-3","first_page":"281","last_page":"296"},"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9994000196456909,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9991000294685364,"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/hamiltonian-path","display_name":"Hamiltonian path","score":0.8510144948959351},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8421328067779541},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.77520751953125},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.562003493309021},{"id":"https://openalex.org/keywords/hamiltonian","display_name":"Hamiltonian (control theory)","score":0.5063892602920532},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5036508440971375},{"id":"https://openalex.org/keywords/induced-path","display_name":"Induced path","score":0.5034131407737732},{"id":"https://openalex.org/keywords/hamiltonian-path-problem","display_name":"Hamiltonian path problem","score":0.4670141339302063},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44724008440971375},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4217844009399414},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.2684759199619293},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.16147756576538086},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.06968942284584045}],"concepts":[{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.8510144948959351},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8421328067779541},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.77520751953125},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.562003493309021},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.5063892602920532},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5036508440971375},{"id":"https://openalex.org/C58228413","wikidata":"https://www.wikidata.org/wiki/Q15704639","display_name":"Induced path","level":5,"score":0.5034131407737732},{"id":"https://openalex.org/C104737047","wikidata":"https://www.wikidata.org/wiki/Q987652","display_name":"Hamiltonian path problem","level":4,"score":0.4670141339302063},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44724008440971375},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4217844009399414},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.2684759199619293},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.16147756576538086},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.06968942284584045},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/0012-365x(83)90165-6","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0012-365x(83)90165-6","pdf_url":null,"source":{"id":"https://openalex.org/S18902827","display_name":"Discrete Mathematics","issn_l":"0012-365X","issn":["0012-365X","1872-681X"],"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":"Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:ris.utwente.nl:openaire/61e2e5ee-11b7-4b39-9dce-35252434828c","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/61e2e5ee-11b7-4b39-9dce-35252434828c","pdf_url":"https://ris.utwente.nl/ws/files/6485757/Veldman83existence.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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Veldman, H J 1983, 'Existence of dominating cycles and paths', Discrete mathematics, vol. 43, no. 2-3, pp. 281-296. https://doi.org/10.1016/0012-365X(83)90165-6","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:ris.utwente.nl:openaire/61e2e5ee-11b7-4b39-9dce-35252434828c","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/61e2e5ee-11b7-4b39-9dce-35252434828c","pdf_url":"https://ris.utwente.nl/ws/files/6485757/Veldman83existence.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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Veldman, H J 1983, 'Existence of dominating cycles and paths', Discrete mathematics, vol. 43, no. 2-3, pp. 281-296. https://doi.org/10.1016/0012-365X(83)90165-6","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2163708037.pdf","grobid_xml":"https://content.openalex.org/works/W2163708037.grobid-xml"},"referenced_works_count":8,"referenced_works":["https://openalex.org/W2005906639","https://openalex.org/W2006711703","https://openalex.org/W2033687719","https://openalex.org/W2035089435","https://openalex.org/W2069905179","https://openalex.org/W2094636165","https://openalex.org/W2576233014","https://openalex.org/W4300303686"],"related_works":["https://openalex.org/W4243020994","https://openalex.org/W2155631825","https://openalex.org/W2050734073","https://openalex.org/W2093397072","https://openalex.org/W140019436","https://openalex.org/W755678515","https://openalex.org/W2557802198","https://openalex.org/W1719252778","https://openalex.org/W2066708286","https://openalex.org/W3106943288"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-03-17T17:19:04.345684","created_date":"2025-10-10T00:00:00"}