Abstract
On considere un graphe G plonge dans un plan. On decrit deux associes de G: son dual et son medial. On montre que les nombres des arbres maximaux de G, des arbres maximaux du dual, des tours euleriens orientes du medial et des arborescences du medial sont les memes
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
