Matching for Graphs of Bounded Degree

DOI10.1007/978-3-540-69311-6_19MaRDI QIDQ3507330zbMATH OpenOpenAlexFDO

Authors Yijie Han

Publication date 19 June 2008

Published in Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-69311-6_19

zbMATH Keywords

lower boundMatching

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Restricted b-matchings in degree-bounded graphs
• scientific article; zbMATH DE number 1471076
• Acyclic matchings in graphs of bounded maximum degree
• Induced matchings in graphs of bounded maximum degree
• On matchings in graphs
• Complexes of graphs with bounded matching size
• Matching and edge-connectivity in graphs with given maximum degree
• Tight lower bounds on the matching number in a graph with given maximum degree
• scientific article; zbMATH DE number 4033793
• Matchings in graphs from the spectral radius

Cites work

• Lower bounds on the cardinality of the maximum matchings of planar graphs
• The Factorization of Linear Graphs
• Tight bounds on maximal and maximum matchings

Cited in

(8)

• An inductive characterization of matching in binding bigraphs
• Quasi-best match graphs
• scientific article; zbMATH DE number 7499157 (Why is no real title available?)
• Tight bound for matching
• Tight lower bounds on the matching number in a graph with given maximum degree
• The sparse awakens: streaming algorithms for matching size estimation in sparse graphs
• Computing large matchings in planar graphs with fixed minimum degree
• Restricted matching in graphs of small genus

This page was built for publication: Matching for Graphs of Bounded Degree

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