Sufficient conditions for matchings

DOI10.1017/S0013091500009809zbMath0248.05130OpenAlexW2140478706MaRDI QIDQ5661922

Ian Anderson

Publication date: 1972

Published in: Proceedings of the Edinburgh Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0013091500009809

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Permutations, words, matrices (05A05)

Related Items

Graph factors and factorization: 1985--2003: a survey, A new multivariat two-sample test using regular minimum-weight spanning subgraphs, Binding numbers and \(f\)-factors of graphs, Unnamed Item, The binding number of a graph and its Anderson number, A sufficient condition for Hamiltonian circuits

Cites Work

• Perfect matchings of a graph
• The Factorization of Linear Graphs