Matchings, cycle bases, and the maximum genus of a graph

zbMath1252.05179MaRDI QIDQ456321

Martin Škoviera, Michal Kotrbčík

Publication date: 24 October 2012

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v19i3p3

zbMATH Keywords

matchingcycle spacefundamental cyclemaximum genus

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Clustering analysis of a dissimilarity: a review of algebraic and geometric representation ⋮ Log-Concavity of the Genus Polynomials of Ringel Ladders

This page was built for publication: Matchings, cycle bases, and the maximum genus of a graph