{"id":"https://openalex.org/W1993974115","doi":"https://doi.org/10.1137/0406027","title":"Counting Embeddings of Planar Graphs Using DFS Trees","display_name":"Counting Embeddings of Planar Graphs Using DFS Trees","publication_year":1993,"publication_date":"1993-08-01","ids":{"openalex":"https://openalex.org/W1993974115","doi":"https://doi.org/10.1137/0406027","mag":"1993974115"},"language":"en","primary_location":{"id":"doi:10.1137/0406027","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0406027","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/A5102583280","display_name":"Jiazhen Cai","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Jiazhen Cai","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5102583280"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.11974365,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"6","issue":"3","first_page":"335","last_page":"352"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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.9997000098228455,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.991599977016449,"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.9840999841690063,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7842985391616821},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7006926536560059},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.619519829750061},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5072343349456787},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4957445561885834},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49178293347358704},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.4756966531276703},{"id":"https://openalex.org/keywords/outerplanar-graph","display_name":"Outerplanar graph","score":0.457955926656723},{"id":"https://openalex.org/keywords/biconnected-graph","display_name":"Biconnected graph","score":0.4398650527000427},{"id":"https://openalex.org/keywords/breadth-first-search","display_name":"Breadth-first search","score":0.4163699448108673},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.32988613843917847},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.25008416175842285},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.12658950686454773},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.06333011388778687}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7842985391616821},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7006926536560059},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.619519829750061},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5072343349456787},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4957445561885834},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49178293347358704},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.4756966531276703},{"id":"https://openalex.org/C125792925","wikidata":"https://www.wikidata.org/wiki/Q3115604","display_name":"Outerplanar graph","level":5,"score":0.457955926656723},{"id":"https://openalex.org/C45725084","wikidata":"https://www.wikidata.org/wiki/Q4390447","display_name":"Biconnected graph","level":5,"score":0.4398650527000427},{"id":"https://openalex.org/C138843760","wikidata":"https://www.wikidata.org/wiki/Q325904","display_name":"Breadth-first search","level":2,"score":0.4163699448108673},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.32988613843917847},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.25008416175842285},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.12658950686454773},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.06333011388778687},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"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/0406027","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0406027","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.34.2534","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.2534","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://cs.nyu.edu/pub/tech-reports/./tr603.ps.Z","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W175929181","https://openalex.org/W204417607","https://openalex.org/W1554000130","https://openalex.org/W1605190445","https://openalex.org/W1655990431","https://openalex.org/W1908738628","https://openalex.org/W1964700557","https://openalex.org/W1987374783","https://openalex.org/W1999667176","https://openalex.org/W2024491681","https://openalex.org/W2034463279","https://openalex.org/W2568036717","https://openalex.org/W4231139853"],"related_works":["https://openalex.org/W2952648278","https://openalex.org/W4300075580","https://openalex.org/W2258906315","https://openalex.org/W2048639803","https://openalex.org/W1501403775","https://openalex.org/W1560307591","https://openalex.org/W2114785943","https://openalex.org/W4226287252","https://openalex.org/W1525489434","https://openalex.org/W4386528600"],"abstract_inverted_index":{"Previously":[0],"counting":[1],"embeddings":[2,53,89],"of":[3,52,54,74,76,90],"planar":[4,56,92],"graphs":[5,57],"used":[6],"P-Q":[7,17],"trees":[8],"and":[9],"was":[10],"restricted":[11],"to":[12,41,86,99],"biconnected":[13],"graphs.":[14],"Although":[15],"the":[16,30,50,72,77,81,100],"tree":[18],"approach":[19],"is":[20,25,71],"conceptually":[21],"simple,":[22],"its":[23],"implementation":[24],"complicated.":[26],"In":[27],"this":[28,33],"paper,":[29],"author":[31,44],"solves":[32],"problem":[34],"using":[35],"DFS":[36],"trees,":[37],"which":[38],"are":[39],"easy":[40],"implement.":[42],"The":[43],"also":[45],"gives":[46],"formulas":[47],"that":[48],"count":[49],"number":[51,73],"general":[55],"(not":[58],"necessarily":[59],"connected":[60],"or":[61],"biconnected)":[62],"in":[63,94],"$O(":[64],"n":[65,70],")$":[66],"arithmetic":[67],"steps,":[68],"where":[69],"vertices":[75],"input":[78],"graph.":[79],"Finally,":[80],"algorithm":[82],"can":[83],"be":[84],"extended":[85],"generate":[87],"all":[88],"a":[91],"graph":[93],"linear":[95],"time":[96],"with":[97],"respect":[98],"output.":[101]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}