On the size and structure of graphs with a constant number of 1-factors

DOI10.1016/j.disc.2012.01.017zbMath1242.05130OpenAlexW2108443159MaRDI QIDQ418889

John R. Schmitt, Andrzej Dudek

Publication date: 30 May 2012

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

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

zbMATH Keywords

1-factorextremal graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items

Extremal Graphs With a Given Number of Perfect Matchings ⋮ On graphs with a unique perfect matching

Cites Work

• Unnamed Item
• Unnamed Item
• Graphs with the maximum or minimum number of 1-factors
• The maximum number of perfect matchings in graphs with a given degree sequence
• On unique \(k\)-factors and unique \([1,k\)-factors in graphs.]
• Hamiltonian Cycles and Uniquely Edge Colourable Graphs
• Extremal Graphs With a Given Number of Perfect Matchings
• On the structure of factorizable graphs. II

This page was built for publication: On the size and structure of graphs with a constant number of 1-factors