The number of 1-factors in 2k-connected graphs

DOI10.1016/0095-8956(78)90011-4zbMath0396.05026OpenAlexW2021055117MaRDI QIDQ1253256

Béla Bollobás

Publication date: 1978

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(78)90011-4

zbMATH Keywords

Number of 1-Factors in a 2k-Connected Graph

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graph theory (05C99) Connectivity (05C40)

Related Items (2)

Factors and factorizations of graphs—a survey ⋮ Eulerian polynomials, Stirling permutations of the second kind and perfect matchings

Cites Work

• Perfect matchings of a graph
• Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
• 1-Faktoren von Graphen. (1-factors of graphs)
• On the 1-factors of a non-separable graph
• On the structure of factorizable graphs
• The Factorization of Linear Graphs

This page was built for publication: The number of 1-factors in 2k-connected graphs