{"doi":"10.1016/j.disc.2018.05.008","title":"On the number of rainbow spanning trees in edge-colored complete graphs","abstract":null,"journal":"Discrete Mathematics","year":2018,"id":638995,"datarank":0.26876392038420827,"base_score":1.791759469228055,"endowment":1.791759469228055,"self_citation_contribution":0.26876392038420827,"citation_network_contribution":0.0,"self_endowment_contribution":0.26876392038420827,"citer_contribution":0.0,"corpus_percentile":null,"corpus_rank":null,"citation_count":5,"citer_count":0,"citers_with_citation_signal":0,"citers_with_endowment":0,"datacite_reuse_total":0,"is_dataset":false,"is_dataset_confidence":null,"is_data_producer":false,"deposit_databanks":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"fair_score":null,"fair_percentile":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":1659946,"name":"Yuan-Hsun Lo","orcid":"0000-0001-5510-8842","position":1,"is_corresponding":false},{"id":1659947,"name":"K.E. Perry","orcid":null,"position":2,"is_corresponding":false},{"id":1659948,"name":"C.A. Rodger","orcid":null,"position":3,"is_corresponding":false},{"id":1659945,"name":"Hung-Lin Fu","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"resolved":true,"title":"On the number of rainbow spanning trees in edge-colored complete graphs","abstract":null,"is_dataset_classified":null,"base_score":1.791759469228055,"endowment":1.791759469228055,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"19767382","pmcid":null,"openalex_id":"https://openalex.org/W2963572511","authors":[],"funders":[],"total_grants":0,"fwci":1.5675,"citation_percentile":0.82338569,"influential_citations":0,"citation_trend":[{"year":2019,"count":1},{"year":2020,"count":1},{"year":2021,"count":1},{"year":2022,"count":1},{"year":2024,"count":1}],"oa_status":"bronze","license":"https://www.elsevier.com/tdm/userlicense/1.0/","oa_locations":[{"url":"https://www.sciencedirect.com/science/article/pii/S0012365X18301481/pdf","host_type":"journal"},{"url":"https://www.sciencedirect.com/science/article/pii/S0012365X18301481/pdf","host_type":"publisher"},{"url":"https://api.elsevier.com/content/article/PII:S0012365X18301481?httpAccept=text/xml","host_type":"publisher"},{"url":"https://api.elsevier.com/content/article/PII:S0012365X18301481?httpAccept=text/plain","host_type":"publisher"},{"url":"https://doi.org/10.1016/j.disc.2018.05.008","host_type":"journal"}],"fields_of_study":["Limits and Structures in Graph Theory","Advanced Graph Theory Research","Graph theory and applications"],"mesh_terms":[],"keywords":["Rainbow","Spanning tree","Combinatorics","Mathematics","Colored","Constructive","Tree (set theory)","Discrete mathematics","Enhanced Data Rates for GSM Evolution","Disjoint sets","Minimum degree spanning tree","Process (computing)","Computer science","Artificial intelligence","Physics"],"sdg_mappings":[{"sdg_number":0,"sdg_label":"Life in Land"}],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-08-06T22:10:05.336547Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"fair_f":null,"fair_a":null,"fair_i":null,"fair_r":null,"fair_zscore":null,"fair_rationale":null,"fair_model":null,"fair_agent_version":null,"fair_fulltext_source":null,"fair_has_llm":null,"fair_computed_at":null,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}