On the 1-factors of a non-separable graph
From MaRDI portal
Publication:5529191
DOI10.1016/S0021-9800(67)80029-2zbMath0149.41402OpenAlexW1984587454MaRDI QIDQ5529191
Michael D. Plummer, Lowell W. Beineke
Publication date: 1967
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0021-9800(67)80029-2
Related Items
The number of trees with a 1-factor, Alternating cycles and paths in edge-coloured multigraphs: A survey, On the structure of factorizable graphs, Algorithmic proofs of two relations between connectivity and the 1- factors of a graph, On unique \(k\)-factors and unique \([1,k\)-factors in graphs.], Excessive index for mesh derived networks, One factors and the existence of affine designs, Some improved bounds on the number of 1-factors of n-connected graphs, The number of 1-factors in 2k-connected graphs, Counting 1-factors in infinite graphs, On the 1-factors of n-connected graphs, 1-Faktoren von Graphen. (1-factors of graphs), On the number of 1-factors of locally finite graphs, Maximum graphs with a unique k-factor, Factors of Inserted Graphs, Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices, Odd factors of a graph
