On the maximum matchings of regular multigraphs

DOI10.1016/0012-365X(81)90143-6zbMath0467.05053OpenAlexW2049321580MaRDI QIDQ1155632

Takao Nishizeki

Publication date: 1981

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

Full work available at URL: https://doi.org/10.1016/0012-365x(81)90143-6

zbMATH Keywords

matchingconnected r-regular multigraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

On maximum \(k\)-edge-colorable subgraphs of bipartite graphs ⋮ On disjoint matchings in cubic graphs ⋮ Cumulants on Wiener chaos: moderate deviations and the fourth moment theorem

Cites Work

• On the relationship between the genus and the cardinality of the maximum matchings of a graph
• Lower bounds on the cardinality of the maximum matchings of planar graphs
• On defect-d matchings in graphs
• Large Matchings in Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the maximum matchings of regular multigraphs