Some improved bounds on the number of 1-factors of n-connected graphs

DOI10.1016/0020-0190(76)90006-5zbMATH Open0357.05059OpenAlexW2078735406MaRDI QIDQ1237991FDOQ1237991

Harold N. Gabow

Publication date: 1976

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(76)90006-5

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Cites Work

• Parallel concepts in graph theory
• On the 1-factors of a non-separable graph
• On the 1-factors of n-connected graphs

Cited In (1)

• Algorithmic proofs of two relations between connectivity and the 1- factors of a graph

This page was built for publication: Some improved bounds on the number of 1-factors of n-connected graphs

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