{"id":"https://openalex.org/W2766061142","doi":"https://doi.org/10.37236/1151","title":"The Absence of Efficient Dual Pairs of Spanning Trees in Planar Graphs","display_name":"The Absence of Efficient Dual Pairs of Spanning Trees in Planar Graphs","publication_year":2006,"publication_date":"2006-08-25","ids":{"openalex":"https://openalex.org/W2766061142","doi":"https://doi.org/10.37236/1151","mag":"2766061142"},"language":"en","primary_location":{"id":"doi:10.37236/1151","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1151","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v13i1n13/pdf","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://www.combinatorics.org/ojs/index.php/eljc/article/download/v13i1n13/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083445287","display_name":"Tim Riley","orcid":"https://orcid.org/0009-0004-3699-0322"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"T. R. Riley","raw_affiliation_strings":["Mathematics Department, 310 Malott Hall, Cornell University, Ithaca NY 14853-4201, USA"],"affiliations":[{"raw_affiliation_string":"Mathematics Department, 310 Malott Hall, Cornell University, Ithaca NY 14853-4201, USA","institution_ids":["https://openalex.org/I205783295"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040489403","display_name":"William P. Thurston","orcid":"https://orcid.org/0000-0003-4157-517X"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"W. P. Thurston","raw_affiliation_strings":["Mathematics Department, 310 Malott Hall, Cornell University, Ithaca NY 14853-4201, USA"],"affiliations":[{"raw_affiliation_string":"Mathematics Department, 310 Malott Hall, Cornell University, Ithaca NY 14853-4201, USA","institution_ids":["https://openalex.org/I205783295"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5083445287"],"corresponding_institution_ids":["https://openalex.org/I205783295"],"apc_list":null,"apc_paid":null,"fwci":0.674,"has_fulltext":true,"cited_by_count":24,"citation_normalized_percentile":{"value":0.74145479,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"13","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"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.9990000128746033,"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/T11152","display_name":"Stochastic processes and statistical mechanics","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9979000091552734,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.871697723865509},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8243456482887268},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.74878990650177},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.6340475678443909},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.6262136697769165},{"id":"https://openalex.org/keywords/dual-graph","display_name":"Dual graph","score":0.516237735748291},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47478243708610535},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46183016896247864},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.4138121008872986}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.871697723865509},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8243456482887268},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.74878990650177},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.6340475678443909},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.6262136697769165},{"id":"https://openalex.org/C169827030","wikidata":"https://www.wikidata.org/wiki/Q2294516","display_name":"Dual graph","level":4,"score":0.516237735748291},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47478243708610535},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46183016896247864},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.4138121008872986},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","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/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.37236/1151","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1151","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v13i1n13/pdf","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:research-information.bris.ac.uk:openaire_cris_publications/28b8507c-ee5a-406a-af45-ced2fcb1a208","is_oa":false,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/28b8507c-ee5a-406a-af45-ced2fcb1a208","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Riley, TR & Thurston, WP 2006, 'The absence of efficient dual pairs of spanning trees in planar graphs', Electronic Journal of Combinatorics, vol. 13 (1, N13), pp. 1 - 7. < http://tinyurl.com/2v5fhr >","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.240.8869","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.240.8869","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/math/0511493v1.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.37236/1151","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1151","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v13i1n13/pdf","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":[{"id":"https://openalex.org/G6512656714","display_name":"Low-dimensional Geometry and Topology","funder_award_id":"0513436","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7669229973","display_name":"The geometry, topology and asymptotics of the word problem","funder_award_id":"0540830","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2766061142.pdf","grobid_xml":"https://content.openalex.org/works/W2766061142.grobid-xml"},"referenced_works_count":6,"referenced_works":["https://openalex.org/W1520357511","https://openalex.org/W1689147513","https://openalex.org/W2035936281","https://openalex.org/W2133001336","https://openalex.org/W2149982027","https://openalex.org/W3010879090"],"related_works":["https://openalex.org/W2246199414","https://openalex.org/W2348567115","https://openalex.org/W4300508906","https://openalex.org/W2003472496","https://openalex.org/W2009424630","https://openalex.org/W2006448585","https://openalex.org/W2622804568","https://openalex.org/W2202852987","https://openalex.org/W4212786251","https://openalex.org/W2284114063"],"abstract_inverted_index":{"A":[0],"spanning":[1,14],"tree":[2,15],"$T$":[3,24,40,48],"in":[4,17,41],"a":[5,12,54],"finite":[6],"planar":[7],"connected":[8],"graph":[9,20],"$G$":[10,42],"determines":[11],"dual":[13,19],"$T^*$":[16,26,50],"the":[18,45,62],"$G^*$":[21],"such":[22,43],"that":[23,32,44],"and":[25,49],"do":[27],"not":[28,35],"intersect.":[29],"We":[30],"show":[31],"it":[33],"is":[34],"always":[36],"possible":[37],"to":[38],"find":[39],"diameters":[46,63],"of":[47,59,61,64],"are":[51],"both":[52],"within":[53],"uniform":[55],"multiplicative":[56],"constant":[57],"(independent":[58],"$G$)":[60],"their":[65],"ambient":[66],"graphs.":[67]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}