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

DOI10.1016/J.DISC.2012.01.017zbMATH Open1242.05130OpenAlexW2108443159MaRDI QIDQ418889FDOQ418889

Authors: John 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

extremal graph1-factor

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites Work

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

Cited In (4)

• Title not available (Why is that?)
• Extremal Graphs With a Given Number of Perfect Matchings
• On graphs with a unique perfect matching
• On the size of graphs with complete-factors

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418889)