{"id":"https://openalex.org/W2087212786","doi":"https://doi.org/10.1016/0012-365x(94)00363-n","title":"Graphs with all spanning trees nonisomorphic","display_name":"Graphs with all spanning trees nonisomorphic","publication_year":1996,"publication_date":"1996-08-01","ids":{"openalex":"https://openalex.org/W2087212786","doi":"https://doi.org/10.1016/0012-365x(94)00363-n","mag":"2087212786"},"language":"en","primary_location":{"id":"doi:10.1016/0012-365x(94)00363-n","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0012-365x(94)00363-n","pdf_url":null,"source":{"id":"https://openalex.org/S18902827","display_name":"Discrete Mathematics","issn_l":"0012-365X","issn":["0012-365X","1872-681X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"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/A5019394646","display_name":"Lars Andersen","orcid":"https://orcid.org/0009-0004-0799-2863"},"institutions":[{"id":"https://openalex.org/I891191580","display_name":"Aalborg University","ror":"https://ror.org/04m5j1k67","country_code":"DK","type":"education","lineage":["https://openalex.org/I891191580"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Lars D\u00f8vling Andersen","raw_affiliation_strings":["Department of Mathematics and Computer Science, Aalborg University, DK-9220, Aalborg \u00f8 Denmark#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Aalborg University, DK-9220, Aalborg \u00f8 Denmark#TAB#","institution_ids":["https://openalex.org/I891191580"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111499309","display_name":"Preben Dahl Vestergaard","orcid":null},"institutions":[{"id":"https://openalex.org/I891191580","display_name":"Aalborg University","ror":"https://ror.org/04m5j1k67","country_code":"DK","type":"education","lineage":["https://openalex.org/I891191580"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Preben Dahl Vestergaard","raw_affiliation_strings":["Department of Mathematics and Computer Science, Aalborg University, DK-9220, Aalborg \u00f8 Denmark#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Aalborg University, DK-9220, Aalborg \u00f8 Denmark#TAB#","institution_ids":["https://openalex.org/I891191580"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5019394646"],"corresponding_institution_ids":["https://openalex.org/I891191580"],"apc_list":{"value":3000,"currency":"USD","value_usd":3000},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.22076392,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"155","issue":"1-3","first_page":"3","last_page":"12"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.9998000264167786,"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"}},{"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9976000189781189,"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.9047573804855347},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8118718862533569},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7395868301391602},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48924827575683594},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.414757639169693}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.9047573804855347},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8118718862533569},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7395868301391602},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48924827575683594},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.414757639169693}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1016/0012-365x(94)00363-n","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0012-365x(94)00363-n","pdf_url":null,"source":{"id":"https://openalex.org/S18902827","display_name":"Discrete Mathematics","issn_l":"0012-365X","issn":["0012-365X","1872-681X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.7.7952","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.7.7952","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.auc.dk/research/reports/R-97-2002.ps","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:publications/7ceeec70-001f-11da-b4d5-000ea68e967b","is_oa":false,"landing_page_url":"https://vbn.aau.dk/da/publications/7ceeec70-001f-11da-b4d5-000ea68e967b","pdf_url":null,"source":{"id":"https://openalex.org/S4306401731","display_name":"VBN Forskningsportal (Aalborg Universitet)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I891191580","host_organization_name":"Aalborg University","host_organization_lineage":["https://openalex.org/I891191580"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Andersen, L D & Vestergaard, P D 1996, 'Graphs with all spanning trees nonisomorphic', Discrete Mathematics, vol. 155, pp. 3-12.","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1606792721","https://openalex.org/W2024693132","https://openalex.org/W2025990657","https://openalex.org/W2029673229","https://openalex.org/W2035160364","https://openalex.org/W2067458708","https://openalex.org/W2080699527","https://openalex.org/W2616697817","https://openalex.org/W2942630558","https://openalex.org/W3047758932","https://openalex.org/W6738002306"],"related_works":["https://openalex.org/W1987177025","https://openalex.org/W4301179398","https://openalex.org/W4389325756","https://openalex.org/W4286893801","https://openalex.org/W2382032469","https://openalex.org/W2487945693","https://openalex.org/W2095369952","https://openalex.org/W1966931974","https://openalex.org/W4296605418","https://openalex.org/W4385493656"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}