On the upper bounds of the numbers of perfect matchings in graphs with given parameters
type: Item
instance of: scholarly article
title: On the upper bounds of the numbers of perfect matchings in graphs with given parameters
zbMATH Open document ID: 1111.05050
author: Hong Lin
author: Xiaofeng Guo
published in: Acta Mathematicae Applicatae Sinica. English Series
publication date: 2007-03-20T00:00:00Z
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 5134787
zbMATH Keywords: connectivity
zbMATH Keywords: chromatic number
zbMATH Keywords: clique number
zbMATH Keywords: diameter
zbMATH Keywords: independence number
zbMATH Keywords: extremal graphs
MaRDI profile type: Publication
full work available at URL: s10255-006-0360-1
OpenAlex ID: W2017040432
cites work: Q4830805
cites work: Q4398864
cites work: Q3097395
cites work: Diameters in graphs
DOI: 10.1007/S10255-006-0360-1
Recommended article: Upper bounds for perfect matchings in Pfaffian and planar graphs
Recommended article: Q3170050
Recommended article: Q5747370
Recommended article: On counting perfect matchings in general graphs
Recommended article: Extremal Graphs With a Given Number of Perfect Matchings
Recommended article: On the number of perfect matchings for some certain types of bipartite graphs
Recommended article: On the number of perfect matchings in a bipartite graph
Recommended article: Counting perfect matchings in \(n\)-extendable graphs
Recommended article: Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges
Recommended article: The maximum number of perfect matchings in graphs with a given degree sequence
description: scientific article; zbMATH DE number 5134787