Pages that link to "Item:Q5529191"
From MaRDI portal
The following pages link to On the 1-factors of a non-separable graph (Q5529191):
Displaying 17 items.
- Excessive index for mesh derived networks (Q491612) (← links)
- One factors and the existence of affine designs (Q687101) (← links)
- Maximum graphs with a unique k-factor (Q790832) (← links)
- The number of trees with a 1-factor (Q1085165) (← links)
- Algorithmic proofs of two relations between connectivity and the 1- factors of a graph (Q1153100) (← links)
- Some improved bounds on the number of 1-factors of n-connected graphs (Q1237991) (← links)
- The number of 1-factors in 2k-connected graphs (Q1253256) (← links)
- Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices (Q1309472) (← links)
- Odd factors of a graph (Q1313354) (← links)
- Alternating cycles and paths in edge-coloured multigraphs: A survey (Q1356728) (← links)
- On unique \(k\)-factors and unique \([1,k]\)-factors in graphs. (Q1427474) (← links)
- Counting 1-factors in infinite graphs (Q1814587) (← links)
- On the number of 1-factors of locally finite graphs (Q1839264) (← links)
- On the 1-factors of n-connected graphs (Q2546879) (← links)
- 1-Faktoren von Graphen. (1-factors of graphs) (Q2551474) (← links)
- Factors of Inserted Graphs (Q3429757) (← links)
- On the structure of factorizable graphs (Q5659593) (← links)
