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

DOI10.1016/0012-365X(79)90017-7MaRDI QIDQ755593zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3141016 (Why is no real title available?)
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 3499787 (Why is no real title available?)
• Additivity of the genus of a graph
• Das Geschlecht des vollständigen paaren Graphen
• Lower bounds on the cardinality of the maximum matchings of planar graphs
• On Hamiltonian Circuits
• Parallel concepts in graph theory
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM

Cited in

(5)

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

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

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