On graphs with a unique perfect matching

DOI10.1007/s00373-014-1463-8zbMath1321.05216OpenAlexW1965983807MaRDI QIDQ497377

Xiumei Wang, Jinjiang Yuan, Wei-Ping Shang

Publication date: 24 September 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-014-1463-8

zbMATH Keywords

treesperfect matchingclaw-free graphssaturated graphs

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Spectral radius and \([a,b\)-factors in graphs] ⋮ Counting spanning trees with a Kekulé structure in linear hexagonal chains ⋮ Graphs with each edge in at most one maximum matching ⋮ On some graphs with a unique perfect matching ⋮ Distance spectrum, 1-factor and vertex-disjoint cycles

Cites Work

• Unnamed Item
• On the maximum number of edges in a hypergraph with a unique perfect matching
• On the size and structure of graphs with a constant number of 1-factors
• The maximum size of graphs with a unique \(k\)-factor
• Maximum graphs with a unique k-factor
• Matching theory
• On unique \(k\)-factors and unique \([1,k\)-factors in graphs.]
• Structural remarks on bipartite graphs with unique \(f\)-factors
• A note concerning graphs with unique f-factors
• Extremal bipartite graphs with a unique k-factor
• On the structure of graphs with a uniquek-factor
• Extremal Graphs With a Given Number of Perfect Matchings
• On the structure of factorizable graphs
• Combinatorial optimization. Theory and algorithms.