Graphs with the maximum or minimum number of 1-factors

DOI10.1016/j.disc.2009.08.016zbMath1214.05120OpenAlexW2040611023MaRDI QIDQ965940

J. T. Saccoman, Nathan Kahl, Daniel Gross

Publication date: 27 April 2010

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

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

zbMATH Keywords

1-factorperfect matchingdegree sequence\(k\)-factor

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (7)

Extremal Graphs With a Given Number of Perfect Matchings ⋮ Extremal graphs for the Tutte polynomial ⋮ Dr. Charles L. Suffel: Scholar, teacher, mentor, friend ⋮ On the size and structure of graphs with a constant number of 1-factors ⋮ Graph vulnerability parameters, compression, and threshold graphs ⋮ Graph vulnerability parameters, compression, and quasi-threshold graphs ⋮ Graphs with the fewest matchings

Cites Work

• Unnamed Item
• The maximum number of perfect matchings in graphs with a given degree sequence
• Matching theory
• Comparison of graphs by their number of spanning trees
• A new technique for the characterization of graphs with a maximum number of spanning trees
• Threshold graphs and related topics
• Inequalities for the gamma function with applications to permanents
• A reliability-improving graph transformation with applications to network reliability
• Maximizing the number of spanning trees in a graph with n nodes and m edges
• Topics in Intersection Graph Theory
• Inequalities: theory of majorization and its applications

This page was built for publication: Graphs with the maximum or minimum number of 1-factors