A sufficient condition for graphs with 1-factors
From MaRDI portal
Publication:3892273
DOI10.4064/cm-41-2-339-344zbMath0447.05035MaRDI QIDQ3892273
Donald L. Goldsmith, Gary Chartrand, Seymour Schuster
Publication date: 1979
Published in: Colloquium Mathematicum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4064/cm-41-2-339-344
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C40: Connectivity
Related Items
Matching and edge-connectivity in regular graphs, Variations on a theorem of Petersen, On zero-sum 6-flows of graphs, Eigenvalues and perfect matchings