On the relationship between the genus and the cardinality of the maximum matchings of a graph

DOI10.1016/0012-365X(79)90017-7zbMath0418.05033OpenAlexW2055065807MaRDI QIDQ755593

Takao Nishizeki

Publication date: 1979

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(79)90017-7

zbMATH Keywords

maximum matchingedge numberconnectivity numbergenus of graphlinear formulasvertex number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (05C99)

Related Items (5)

Matching extension and the genus of a graph ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ Lower bounds on the cardinality of the maximum matchings of planar graphs ⋮ On the maximum matchings of regular multigraphs ⋮ Surface embedding of \((n,k)\)-extendable graphs

Cites Work

• Lower bounds on the cardinality of the maximum matchings of planar graphs
• Parallel concepts in graph theory
• Das Geschlecht des vollständigen paaren Graphen
• Additivity of the genus of a graph
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
• On Hamiltonian Circuits
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the relationship between the genus and the cardinality of the maximum matchings of a graph