Large Matchings in Graphs

DOI10.4153/CJM-1974-145-8MaRDI QIDQ4065579zbMATH OpenFDO

Authors

Publication date 1974

Published in Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/CJM-1974-145-8

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Cited in

(6)

• Lower bounds on the cardinality of the maximum matchings of planar graphs
• On the maximum matchings of regular multigraphs
• 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
• On disjoint matchings in cubic graphs

This page was built for publication: Large Matchings in Graphs

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