{"id":"https://openalex.org/W2132897805","doi":"https://doi.org/10.1137/140954957","title":"A Planarity Criterion for Graphs","display_name":"A Planarity Criterion for Graphs","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2132897805","doi":"https://doi.org/10.1137/140954957","mag":"2132897805"},"language":"en","primary_location":{"id":"doi:10.1137/140954957","is_oa":false,"landing_page_url":"https://doi.org/10.1137/140954957","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/A5018558191","display_name":"Kosta Do\u0161en","orcid":null},"institutions":[{"id":"https://openalex.org/I1338511612","display_name":"Serbian Academy of Sciences and Arts","ror":"https://ror.org/05m1y4204","country_code":"RS","type":"government","lineage":["https://openalex.org/I1338511612"]}],"countries":["RS"],"is_corresponding":false,"raw_author_name":"Kosta Do\u0161en","raw_affiliation_strings":["Serbian Academy of Sciences and Arts"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Serbian Academy of Sciences and Arts","institution_ids":["https://openalex.org/I1338511612"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030384983","display_name":"Zoran Petri\u0107","orcid":null},"institutions":[{"id":"https://openalex.org/I1338511612","display_name":"Serbian Academy of Sciences and Arts","ror":"https://ror.org/05m1y4204","country_code":"RS","type":"government","lineage":["https://openalex.org/I1338511612"]}],"countries":["RS"],"is_corresponding":false,"raw_author_name":"Zoran Petri\u0107","raw_affiliation_strings":["Serbian Academy of Sciences and Arts"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Serbian Academy of Sciences and Arts","institution_ids":["https://openalex.org/I1338511612"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I1338511612"],"apc_list":null,"apc_paid":null,"fwci":0.8856,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.79984733,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"29","issue":"4","first_page":"2160","last_page":"2165"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.9954000115394592,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9836999773979187,"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/planarity-testing","display_name":"Planarity testing","score":0.9829152822494507},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7683034539222717},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.7369422912597656},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7022146582603455},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4845994710922241},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.46986091136932373},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46452438831329346},{"id":"https://openalex.org/keywords/book-embedding","display_name":"Book embedding","score":0.45261555910110474},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.4427543878555298},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.4301992654800415},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.15913125872612},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.12162074446678162},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1115865409374237}],"concepts":[{"id":"https://openalex.org/C68260962","wikidata":"https://www.wikidata.org/wiki/Q7200967","display_name":"Planarity testing","level":2,"score":0.9829152822494507},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7683034539222717},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7369422912597656},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7022146582603455},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4845994710922241},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.46986091136932373},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46452438831329346},{"id":"https://openalex.org/C180222743","wikidata":"https://www.wikidata.org/wiki/Q4942980","display_name":"Book embedding","level":5,"score":0.45261555910110474},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.4427543878555298},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.4301992654800415},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.15913125872612},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.12162074446678162},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1115865409374237},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/140954957","is_oa":false,"landing_page_url":"https://doi.org/10.1137/140954957","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:CiteSeerX.psu:10.1.1.753.3386","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.753.3386","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1203.0996.pdf","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":9,"referenced_works":["https://openalex.org/W174566906","https://openalex.org/W1529400447","https://openalex.org/W1530753374","https://openalex.org/W1601296025","https://openalex.org/W2070459622","https://openalex.org/W2149136800","https://openalex.org/W2333948988","https://openalex.org/W2799004609","https://openalex.org/W4253221855"],"related_works":["https://openalex.org/W2373079339","https://openalex.org/W4297837089","https://openalex.org/W4293351855","https://openalex.org/W2578113559","https://openalex.org/W2964235359","https://openalex.org/W4287691299","https://openalex.org/W3047848516","https://openalex.org/W3134933682","https://openalex.org/W2799803339","https://openalex.org/W2953315950"],"abstract_inverted_index":{"It":[0],"is":[1,7,35,99],"proved":[2],"that":[3,43,59,79],"a":[4,49,56],"connected":[5],"graph":[6],"planar":[8],"if":[9,12],"and":[10,108,118,130],"only":[11],"all":[13],"its":[14],"cocycles":[15],"with":[16,44],"at":[17],"least":[18],"four":[19],"edges":[20,54],"are":[21,126],"\u201cgrounded\u201d":[22],"in":[23,60,89],"the":[24,40,53,61,66,81,90,93,97,111,124],"graph.":[25],"The":[26,86],"notion":[27],"of":[28,30,52,55,68,76,83,92,96,123],"grounding":[29],"this":[31],"planarity":[32,105],"criterion,":[33],"which":[34],"purely":[36],"combinatorial,":[37],"stems":[38],"from":[39],"intuitive":[41],"idea":[42],"planarity,":[45],"there":[46,71],"should":[47],"be":[48,73],"linear":[50],"ordering":[51],"cocycle":[57],"such":[58],"two":[62],"subgraphs":[63],"remaining":[64],"after":[65],"removal":[67],"these":[69,84],"edges,":[70],"can":[72],"no":[74],"crossing":[75],"disjoint":[77],"paths":[78],"join":[80],"vertices":[82],"edges.":[85],"proof":[87],"given":[88],"paper":[91],"right-to-left":[94],"direction":[95],"equivalence":[98],"based":[100],"on":[101],"Kuratowski's":[102],"theorem":[103],"for":[104,132],"involving":[106],"$K_{3,3}$":[107,117],"$K_5$,":[109],"but":[110],"criterion":[112,125],"itself":[113],"does":[114],"not":[115],"mention":[116],"$K_5$.":[119],"Some":[120],"other":[121],"variants":[122],"also":[127],"shown":[128],"necessary":[129],"sufficient":[131],"planarity.":[133]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}