{"id":"https://openalex.org/W1871983861","doi":"https://doi.org/10.37236/2378","title":"Improved Upper Bounds for Planarization and Series-Parallelization of Degree-Bounded Graphs","display_name":"Improved Upper Bounds for Planarization and Series-Parallelization of Degree-Bounded Graphs","publication_year":2012,"publication_date":"2012-05-31","ids":{"openalex":"https://openalex.org/W1871983861","doi":"https://doi.org/10.37236/2378","mag":"1871983861"},"language":"en","primary_location":{"id":"doi:10.37236/2378","is_oa":true,"landing_page_url":"https://doi.org/10.37236/2378","pdf_url":null,"source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.37236/2378","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101571000","display_name":"Keith Edwards","orcid":"https://orcid.org/0009-0006-9223-9749"},"institutions":[{"id":"https://openalex.org/I177639307","display_name":"University of Dundee","ror":"https://ror.org/03h2bxq36","country_code":"GB","type":"education","lineage":["https://openalex.org/I177639307"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Keith Edwards","raw_affiliation_strings":["University of Dundee"],"affiliations":[{"raw_affiliation_string":"University of Dundee","institution_ids":["https://openalex.org/I177639307"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005637509","display_name":"Graham Farr","orcid":null},"institutions":[{"id":"https://openalex.org/I2801239119","display_name":"Australian Regenerative Medicine Institute","ror":"https://ror.org/02qa5kg76","country_code":"AU","type":"facility","lineage":["https://openalex.org/I2801037857","https://openalex.org/I2801239119","https://openalex.org/I56590836"]},{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Graham Farr","raw_affiliation_strings":["Monash University","Monash university"],"affiliations":[{"raw_affiliation_string":"Monash University","institution_ids":["https://openalex.org/I2801239119","https://openalex.org/I56590836"]},{"raw_affiliation_string":"Monash university","institution_ids":["https://openalex.org/I2801239119"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101571000"],"corresponding_institution_ids":["https://openalex.org/I177639307"],"apc_list":null,"apc_paid":null,"fwci":2.0767,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.8622161,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"19","issue":"2","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9991000294685364,"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/T11567","display_name":"semigroups and automata theory","score":0.9991000294685364,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9987000226974487,"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/T12288","display_name":"Optimization and Search Problems","score":0.9944999814033508,"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/mathematics","display_name":"Mathematics","score":0.8120409250259399},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7691068053245544},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.651091456413269},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6418924927711487},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5938774943351746},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5559066534042358},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5105034112930298},{"id":"https://openalex.org/keywords/series","display_name":"Series (stratigraphy)","score":0.48885101079940796},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.4668223261833191},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.4388878345489502},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4133647680282593},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.4107034206390381}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8120409250259399},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7691068053245544},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.651091456413269},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6418924927711487},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5938774943351746},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5559066534042358},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5105034112930298},{"id":"https://openalex.org/C143724316","wikidata":"https://www.wikidata.org/wiki/Q312468","display_name":"Series (stratigraphy)","level":2,"score":0.48885101079940796},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.4668223261833191},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.4388878345489502},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4133647680282593},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.4107034206390381},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.37236/2378","is_oa":true,"landing_page_url":"https://doi.org/10.37236/2378","pdf_url":null,"source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},{"id":"pmh:oai:discovery.dundee.ac.uk:publications/2005ef7f-c673-4b3f-bd3b-26aaf1abdd6c","is_oa":true,"landing_page_url":"https://discovery.dundee.ac.uk/en/publications/2005ef7f-c673-4b3f-bd3b-26aaf1abdd6c","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v19i2p25/pdf","source":{"id":"https://openalex.org/S4306400523","display_name":"Discovery Research Portal (University of Dundee)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177639307","host_organization_name":"University of Dundee","host_organization_lineage":["https://openalex.org/I177639307"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Edwards, K & Farr, G 2012, 'Improved upper bounds for planarization and series-parallelization of degree-bounded graphs', Electronic Journal of Combinatorics, vol. 19, no. 2, P25. < http://www.combinatorics.org/ojs/index.php/eljc/article/view/v19i2p25 >","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.362.1628","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.362.1628","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.combinatorics.org/ojs/index.php/eljc/article/viewFile/v19i2p25/pdf/","raw_type":"text"},{"id":"pmh:oai:monash.edu:Publications/0f7d2270-d74b-4ed3-86d1-e41c0978ede0","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306402625","display_name":"Monash University Research Portal (Monash University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I56590836","host_organization_name":"Monash University","host_organization_lineage":["https://openalex.org/I56590836"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:monash.edu:openaire/0f7d2270-d74b-4ed3-86d1-e41c0978ede0","is_oa":true,"landing_page_url":"https://research.monash.edu/en/publications/0f7d2270-d74b-4ed3-86d1-e41c0978ede0","pdf_url":null,"source":{"id":"https://openalex.org/S4306402625","display_name":"Monash University Research Portal (Monash University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I56590836","host_organization_name":"Monash University","host_organization_lineage":["https://openalex.org/I56590836"],"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":"Edwards, K J & Farr, G E 2012, 'Improved upper bounds for planarization and series-parallelization of degree-bounded graphs', The Electronic Journal of Combinatorics, vol. 19, no. 2, pp. 1 - 19. < http://www.combinatorics.org/ojs/index.php/eljc/article/view/v19i2p25/pdf >","raw_type":"article"},{"id":"pmh:oai:monash.edu:publications/0f7d2270-d74b-4ed3-86d1-e41c0978ede0","is_oa":true,"landing_page_url":"http://www.combinatorics.org/ojs/index.php/eljc/article/view/v19i2p25/pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306402625","display_name":"Monash University Research Portal (Monash University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I56590836","host_organization_name":"Monash University","host_organization_lineage":["https://openalex.org/I56590836"],"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":"Edwards, K J & Farr, G E 2012, 'Improved upper bounds for planarization and series-parallelization of degree-bounded graphs', The Electronic Journal of Combinatorics, vol. 19, no. 2, pp. 1 - 19. < http://www.combinatorics.org/ojs/index.php/eljc/article/view/v19i2p25/pdf >","raw_type":"article"}],"best_oa_location":{"id":"doi:10.37236/2378","is_oa":true,"landing_page_url":"https://doi.org/10.37236/2378","pdf_url":null,"source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1564233884","https://openalex.org/W1581592080","https://openalex.org/W2071177062","https://openalex.org/W2087167825","https://openalex.org/W2111635834","https://openalex.org/W2141063223","https://openalex.org/W2163269124","https://openalex.org/W2168320078","https://openalex.org/W4247832516","https://openalex.org/W4251875563"],"related_works":["https://openalex.org/W603403972","https://openalex.org/W2061237693","https://openalex.org/W1554245510","https://openalex.org/W4285762950","https://openalex.org/W2239518402","https://openalex.org/W2083238533","https://openalex.org/W2152638828","https://openalex.org/W3121955789","https://openalex.org/W2564891670","https://openalex.org/W1578113210"],"abstract_inverted_index":{"We":[0,21],"study":[1],"the":[2,27,60,70,73,92,97,116],"number":[3,28],"of":[4,29,35,52,54,57,62,94,96,99,102,118],"vertices":[5,30,63],"which":[6],"must":[7],"be":[8,67],"removed":[9,68],"from":[10,69],"a":[11,55],"graph":[12],"in":[13,72,75],"order":[14,76],"to":[15,32,66,77],"make":[16],"it":[17],"planar":[18],"or":[19],"series-parallel.":[20],"give":[22,111],"improved":[23,46,89,113],"upper":[24],"bounds":[25,85,90],"on":[26,86,115],"required":[31],"planarize":[33],"graphs":[34,58,71,101],"bounded":[36,80],"average":[37,103],"degree":[38,104],"$d$,":[39],"and":[40],"for":[41,48,91],"small":[42],"$d$":[43],"also":[44],"an":[45,108,112],"bound":[47,114],"series-parallelization.":[49],"The":[50,83],"coefficient":[51,93],"fragmentability":[53,95],"class":[56,74,98],"measures":[59],"proportion":[61],"that":[64],"need":[65],"leave":[78],"behind":[79],"sized":[81],"components.":[82],"above":[84],"planarization":[87],"yield":[88],"connected":[100],"at":[105],"most":[106],"$d$.As":[107],"application":[109],"we":[110],"size":[117],"regular":[119],"expressions":[120],"representing":[121],"deterministic":[122],"finite":[123],"automata.":[124]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}