{"doi":"10.1002/jgt.3190100306","title":"An Eulerian exposition","abstract":"<jats:title>Abstract</jats:title>\n                  <jats:p>An overview of Eulerian graphs is presented. In particular, characterizations of Eulerian graphs and digraphs as well as algorithms for constructing Eulerian circuits are discussed. A solution to the Chinese postman problem is followed by a study of subgraphs and supergraphs of Eulerian graphs. After an introduction to randomly Eulerian graphs and digraphs, we conclude with a summary of a variety of results involving enumeration.</jats:p>","journal":"Journal of Graph Theory","year":1986,"id":683121,"datarank":0.4943755299006494,"base_score":3.295836866004329,"endowment":3.295836866004329,"self_citation_contribution":0.4943755299006494,"citation_network_contribution":0.0,"self_endowment_contribution":0.4943755299006494,"citer_contribution":0.0,"corpus_percentile":null,"corpus_rank":null,"citation_count":26,"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":1784542,"name":"Ortrud R. Oellermann","orcid":null,"position":1,"is_corresponding":false},{"id":1784540,"name":"Linda Lesniak","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"resolved":true,"title":"An Eulerian exposition","abstract":"<jats:title>Abstract</jats:title>\n                  <jats:p>An overview of Eulerian graphs is presented. In particular, characterizations of Eulerian graphs and digraphs as well as algorithms for constructing Eulerian circuits are discussed. A solution to the Chinese postman problem is followed by a study of subgraphs and supergraphs of Eulerian graphs. After an introduction to randomly Eulerian graphs and digraphs, we conclude with a summary of a variety of results involving enumeration.</jats:p>","is_dataset_classified":null,"base_score":3.295836866004329,"endowment":3.295836866004329,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"26207759","pmcid":null,"openalex_id":"https://openalex.org/W2034363746","authors":[],"funders":[],"total_grants":0,"fwci":0.9814,"citation_percentile":0.75258702,"influential_citations":0,"citation_trend":[{"year":2012,"count":2},{"year":2013,"count":1},{"year":2014,"count":1},{"year":2015,"count":2},{"year":2016,"count":1},{"year":2021,"count":1},{"year":2022,"count":1},{"year":2023,"count":1},{"year":2024,"count":1},{"year":2026,"count":1}],"oa_status":"closed","license":"http://onlinelibrary.wiley.com/termsAndConditions#vor","oa_locations":[{"url":"https://api.wiley.com/onlinelibrary/tdm/v1/articles/10.1002%2Fjgt.3190100306","host_type":"publisher"},{"url":"https://onlinelibrary.wiley.com/doi/pdf/10.1002/jgt.3190100306","host_type":"publisher"},{"url":"https://doi.org/10.1002/jgt.3190100306","host_type":"journal"}],"fields_of_study":["Graph theory and applications","Advanced Graph Theory Research","Limits and Structures in Graph Theory"],"mesh_terms":[],"keywords":["Eulerian path","Mathematics","Exposition (narrative)","Combinatorics","Discrete mathematics","Applied mathematics"],"sdg_mappings":[],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-08-17T22:28:00.108600Z","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":[]}