Skip to Main Content

Proceedings of the American Mathematical Society

Published by the American Mathematical Society since 1950, Proceedings of the American Mathematical Society is devoted to shorter research articles in all areas of pure and applied mathematics.

ISSN 1088-6826 (online) ISSN 0002-9939 (print)

The 2020 MCQ for Proceedings of the American Mathematical Society is 0.85.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Pseudo-matchings of a bipartite graph
HTML articles powered by AMS MathViewer

by Alan Brace and D. E. Daykin PDF
Proc. Amer. Math. Soc. 42 (1974), 28-32 Request permission

Corrigendum: Proc. Amer. Math. Soc. 56 (1976), 380-382.

Abstract:

Let G be a graph whose edges (x, y) have $x \in X,y \in Y,|X| = |Y| < \infty$ . A (t, u) cover of G is a set of t edges which cover $\geqq u$ vertices in both X and Y. We give conditions on the valency (minimum local degree) and the number of edges which ensure a (t, u) cover or that a Hamiltonian circuit exists.
References
    Alan Brace, Some combinatorial cover theorems, Ph.D. Thesis, University of Western Australia, 1971.
  • Claude Berge, Théorie des graphes et ses applications, Collection Universitaire de Mathématiques, II, Dunod, Paris, 1958 (French). MR 0102822
  • D. R. Woodall, Sufficient conditions for circuits in graphs, Proc. London Math. Soc. (3) 24 (1972), 739–755. MR 318000, DOI 10.1112/plms/s3-24.4.739
Similar Articles
  • Retrieve articles in Proceedings of the American Mathematical Society with MSC: 05C35
  • Retrieve articles in all journals with MSC: 05C35
Additional Information
  • © Copyright 1974 American Mathematical Society
  • Journal: Proc. Amer. Math. Soc. 42 (1974), 28-32
  • MSC: Primary 05C35
  • DOI: https://doi.org/10.1090/S0002-9939-1974-0329960-9
  • MathSciNet review: 0329960