{"id":"https://openalex.org/W1966133933","doi":"https://doi.org/10.1007/s00373-012-1144-4","title":"Intervals and Convex Sets in Strong Product of Graphs","display_name":"Intervals and Convex Sets in Strong Product of Graphs","publication_year":2012,"publication_date":"2012-03-03","ids":{"openalex":"https://openalex.org/W1966133933","doi":"https://doi.org/10.1007/s00373-012-1144-4","mag":"1966133933"},"language":"en","primary_location":{"id":"doi:10.1007/s00373-012-1144-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00373-012-1144-4","pdf_url":null,"source":{"id":"https://openalex.org/S186126824","display_name":"Graphs and Combinatorics","issn_l":"0911-0119","issn":["0911-0119","1435-5914"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Graphs and Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://dk.um.si/IzpisGradiva.php?id=52017","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5003861860","display_name":"Iztok Peterin","orcid":"https://orcid.org/0000-0002-1990-6967"},"institutions":[{"id":"https://openalex.org/I37696226","display_name":"University of Maribor","ror":"https://ror.org/01d5jce07","country_code":"SI","type":"education","lineage":["https://openalex.org/I37696226"]},{"id":"https://openalex.org/I4210106342","display_name":"Institute of Mathematics, Physics, and Mechanics","ror":"https://ror.org/01eb3qa50","country_code":"SI","type":"facility","lineage":["https://openalex.org/I4210106342"]}],"countries":["SI"],"is_corresponding":true,"raw_author_name":"Iztok Peterin","raw_affiliation_strings":["Institute of Mathematics and Physics, FEECS, University of Maribor, Smetanova 17, 2000, Maribor, Slovenia","Institute of Mathematics, Physics and Mechanics, Jadranska 19, 1000, Ljubljana, Slovenia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Mathematics and Physics, FEECS, University of Maribor, Smetanova 17, 2000, Maribor, Slovenia","institution_ids":["https://openalex.org/I37696226"]},{"raw_affiliation_string":"Institute of Mathematics, Physics and Mechanics, Jadranska 19, 1000, Ljubljana, Slovenia","institution_ids":["https://openalex.org/I4210106342"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5003861860"],"corresponding_institution_ids":["https://openalex.org/I37696226","https://openalex.org/I4210106342"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":2.9185,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.90795638,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"29","issue":"3","first_page":"705","last_page":"714"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"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.9994999766349792,"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.9994000196456909,"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"}},{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.9994000196456909,"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/mathematics","display_name":"Mathematics","score":0.8561457395553589},{"id":"https://openalex.org/keywords/convexity","display_name":"Convexity","score":0.8039631843566895},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.759896993637085},{"id":"https://openalex.org/keywords/product","display_name":"Product (mathematics)","score":0.6344634294509888},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5298013091087341},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4887540340423584},{"id":"https://openalex.org/keywords/convex-combination","display_name":"Convex combination","score":0.44303181767463684},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.4170820415019989},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4138638973236084},{"id":"https://openalex.org/keywords/convex-analysis","display_name":"Convex analysis","score":0.41097697615623474},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3699032664299011},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.1637745499610901},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.099585622549057},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.06511041522026062},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.0552162230014801}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8561457395553589},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.8039631843566895},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.759896993637085},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.6344634294509888},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5298013091087341},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4887540340423584},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.44303181767463684},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.4170820415019989},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4138638973236084},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.41097697615623474},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3699032664299011},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.1637745499610901},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.099585622549057},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.06511041522026062},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0552162230014801},{"id":"https://openalex.org/C106159729","wikidata":"https://www.wikidata.org/wiki/Q2294553","display_name":"Financial economics","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00373-012-1144-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00373-012-1144-4","pdf_url":null,"source":{"id":"https://openalex.org/S186126824","display_name":"Graphs and Combinatorics","issn_l":"0911-0119","issn":["0911-0119","1435-5914"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Graphs and Combinatorics","raw_type":"journal-article"},{"id":"pmh:oai:dk.um.si:IzpisGradiva.php?id=52017","is_oa":true,"landing_page_url":"https://dk.um.si/IzpisGradiva.php?id=52017","pdf_url":null,"source":{"id":"https://openalex.org/S4377196302","display_name":"University of Maribor digital library (University of Maribor)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I37696226","host_organization_name":"University of Maribor","host_organization_lineage":["https://openalex.org/I37696226"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Graphs and combinatorics, vol. 3, no. 29, pp. 705-714, 2013.","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:dk.um.si:IzpisGradiva.php?id=52017","is_oa":true,"landing_page_url":"https://dk.um.si/IzpisGradiva.php?id=52017","pdf_url":null,"source":{"id":"https://openalex.org/S4377196302","display_name":"University of Maribor digital library (University of Maribor)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I37696226","host_organization_name":"University of Maribor","host_organization_lineage":["https://openalex.org/I37696226"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Graphs and combinatorics, vol. 3, no. 29, pp. 705-714, 2013.","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W173337542","https://openalex.org/W577570849","https://openalex.org/W1576113015","https://openalex.org/W1583318653","https://openalex.org/W1963704255","https://openalex.org/W1980522665","https://openalex.org/W1989222222","https://openalex.org/W1995228121","https://openalex.org/W2003475527","https://openalex.org/W2041134979","https://openalex.org/W2061819450","https://openalex.org/W2070152318","https://openalex.org/W2080040151","https://openalex.org/W2080743565","https://openalex.org/W2091254185","https://openalex.org/W2124840911","https://openalex.org/W2149733797","https://openalex.org/W2335057355","https://openalex.org/W2490805901","https://openalex.org/W2527857428","https://openalex.org/W4239089288"],"related_works":["https://openalex.org/W2391247224","https://openalex.org/W2376997122","https://openalex.org/W2026600343","https://openalex.org/W4382519084","https://openalex.org/W2112761337","https://openalex.org/W2478309485","https://openalex.org/W4311073519","https://openalex.org/W2357433048","https://openalex.org/W2002037426","https://openalex.org/W868123585"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":8}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}