On the 1-factors of a non-separable graph

DOI10.1016/S0021-9800(67)80029-2MaRDI QIDQ5529191zbMATH OpenOpenAlexFDO

Authors Michael D. Plummer, L. 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

zbMATH Keywords

topology

Cited in

(17)

• The number of 1-factors in 2k-connected graphs
• 1-Faktoren von Graphen. (1-factors of graphs)
• On unique \(k\)-factors and unique \([1,k]\)-factors in graphs.
• Counting 1-factors in infinite graphs
• The number of trees with a 1-factor
• Algorithmic proofs of two relations between connectivity and the 1- factors of a graph
• Some improved bounds on the number of 1-factors of n-connected graphs
• Odd factors of a graph
• Alternating cycles and paths in edge-coloured multigraphs: A survey
• Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices
• Excessive index for mesh derived networks
• On the number of 1-factors of locally finite graphs
• On the 1-factors of n-connected graphs
• On the structure of factorizable graphs
• Maximum graphs with a unique k-factor
• One factors and the existence of affine designs
• Factors of Inserted Graphs

This page was built for publication: On the 1-factors of a non-separable graph

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