Characterizing the maximum genus of a connected graph

From MaRDI portal





The author shows a neat way how generalized versions of Tutte's perfect matching theorem and Rado's independent transversals theorem can be used to characterize the maximum genus of a connected graph.











This page was built for publication: Characterizing the maximum genus of a connected graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4277394)