Graphs with the maximum or minimum number of 1-factors
type: Item
instance of: scholarly article
title: Graphs with the maximum or minimum number of 1-factors
zbMATH Open document ID: 1214.05120
author: John T. Saccoman
author: Daniel J. Gross
author: Nathan Kahl
published in: Discrete Mathematics
publication date: 2010-04-27T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C25
zbMATH DE Number: 5701921
zbMATH Keywords: \(k\)-factor
zbMATH Keywords: 1-factor
zbMATH Keywords: perfect matching
zbMATH Keywords: degree sequence
MaRDI profile type: Publication
full work available at URL: j.disc.2009.08.016
OpenAlex ID: W2040611023
cites work: The maximum number of perfect matchings in graphs with a given degree sequence
cites work: Q3852212
cites work: Inequalities for the gamma function with applications to permanents
cites work: Comparison of graphs by their number of spanning trees
cites work: Matching theory
cites work: Threshold graphs and related topics
cites work: Inequalities: theory of majorization and its applications
cites work: Topics in Intersection Graph Theory
cites work: A new technique for the characterization of graphs with a maximum number of spanning trees
cites work: A reliability-improving graph transformation with applications to network reliability
cites work: Maximizing the number of spanning trees in a graph with n nodes and m edges
DOI: 10.1016/J.DISC.2009.08.016
description: scientific article; zbMATH DE number 5701921