Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Bounds on maximum \(b\)-matchings

From MaRDI portal
Publication:1043589
Jump to:navigation, search

DOI10.1016/j.disc.2008.10.018zbMath1177.05092OpenAlexW2047399181MaRDI QIDQ1043589

Wangsen Feng

Publication date: 9 December 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2008.10.018


zbMATH Keywords

maximum matchingcardinality boundmaximum \(b\)-matching


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

  • Unnamed Item
  • Matching theory
  • Lower bounds on the cardinality of the maximum matchings of planar graphs
  • Tight bounds on maximal and maximum matchings
  • Tight lower bounds on the size of a maximum matching in a regular graph
  • The Factorization of Linear Graphs
  • The Factors of Graphs




This page was built for publication: Bounds on maximum \(b\)-matchings

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1043589&oldid=13053624"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 22:57.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki