On the maximum matchings of regular multigraphs

DOI10.1016/0012-365X(81)90143-6MaRDI QIDQ1155632zbMATH OpenOpenAlexFDO

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

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 3641462 (Why is no real title available?)
• scientific article; zbMATH DE number 3449757 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Large Matchings in Graphs
• Lower bounds on the cardinality of the maximum matchings of planar graphs
• On defect-d matchings in graphs
• On the relationship between the genus and the cardinality of the maximum matchings of a graph

Cited in

(5)

• On disjoint matchings in cubic graphs
• On maximum \(k\)-edge-colorable subgraphs of bipartite graphs
• Graphs, disjoint matchings and some inequalities
• The maximum 2-edge-colorable subgraph problem and its fixed-parameter tractability
• Cumulants on Wiener chaos: moderate deviations and the fourth moment theorem

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

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