{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:54Z","timestamp":1753893834907,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>Classical parking functions can be de\ufb01ned in terms of drivers with preferred parking spaces searching a linear parking lot for an open parking spot. We may consider this linear parking lot as a collection of n vertices (parking spots) arranged in a directed path. We generalize this notion to allow for more complicated \u201cparking lots\u201d and de\ufb01ne parking functions on arbitrary directed graphs. We then consider a relationship proved by Lackner and Panholzer between parking functions on trees and \u201cmapping digraphs\u201d and we show that a similar relationship holds when edge orientations are reversed.<\/jats:p>","DOI":"10.37236\/9051","type":"journal-article","created":{"date-parts":[[2020,6,26]],"date-time":"2020-06-26T00:52:18Z","timestamp":1593132738000},"source":"Crossref","is-referenced-by-count":1,"title":["Parking Functions on Directed Graphs and Some Directed Trees"],"prefix":"10.37236","volume":"27","author":[{"given":"Westin","family":"King","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Catherine H.","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2020,6,12]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v27i2p48\/8105","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v27i2p48\/8105","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,26]],"date-time":"2020-06-26T00:52:34Z","timestamp":1593132754000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v27i2p48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,12]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2020,4,3]]}},"URL":"https:\/\/doi.org\/10.37236\/9051","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2020,6,12]]},"article-number":"P2.48"}}