Pages that link to "Item:Q2546879"
From MaRDI portal
The following pages link to On the 1-factors of n-connected graphs (Q2546879):
Displaying 8 items.
- Algorithmic proofs of two relations between connectivity and the 1- factors of a graph (Q1153100) (← links)
- Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
- Pairs of Hamiltonian circuits in 5-connected planar graphs (Q1218869) (← links)
- Some improved bounds on the number of 1-factors of n-connected graphs (Q1237991) (← links)
- Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices (Q1309472) (← links)
- Counting 1-factors in infinite graphs (Q1814587) (← links)
- On the number of 1-factors of locally finite graphs (Q1839264) (← links)
- Construction of k-matchings in graph products (Q5058206) (← links)