On graphs with a unique perfect matching
type: Item
instance of: scholarly article
title: On graphs with a unique perfect matching
zbMATH Open document ID: 1321.05216
author: Xiumei Wang
author: Jinjiang Yuan
author: Weiping Shang
published in: Graphs and Combinatorics
publication date: 2015-09-24T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 6484843
zbMATH Keywords: perfect matching
zbMATH Keywords: trees
zbMATH Keywords: claw-free graphs
zbMATH Keywords: saturated graphs
MaRDI profile type: Publication
full work available at URL: s00373-014-1463-8
OpenAlex ID: W1965983807
cites work: On the maximum number of edges in a hypergraph with a unique perfect matching
cites work: Q5422499
cites work: On the size and structure of graphs with a constant number of 1-factors
cites work: Extremal Graphs With a Given Number of Perfect Matchings
cites work: Maximum graphs with a unique k-factor
cites work: Extremal bipartite graphs with a unique k-factor
cites work: On unique \(k\)-factors and unique \([1,k]\)-factors in graphs.
cites work: Structural remarks on bipartite graphs with unique \(f\)-factors
cites work: A note concerning graphs with unique f-factors
cites work: On the structure of graphs with a uniquek-factor
cites work: Combinatorial optimization. Theory and algorithms.
cites work: On the structure of factorizable graphs
cites work: Matching theory
cites work: The maximum size of graphs with a unique \(k\)-factor
DOI: 10.1007/S00373-014-1463-8
description: scientific article; zbMATH DE number 6484843