Author:
Haghparast Nastaran,Kiani Dariush
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference7 articles.
1. Biedl, T., Demaine, E.D., Duncan, C.A., Fleischer, R., Kobourov, S.G.: Tight bounds on maximal and maximum matchings. Discret. Math. 285(1), 7–15 (2004)
2. Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. American Elsevier, New York (1976)
3. Cheng, J., Zhang, C.-Q., Zhu, B.-X.: Even factors of graphs. J. Combin. Optim. 33, 1343–1353 (2017)
4. Lai, H.-J.: Lecture notes on supereulerian graphs and related topics, unpublished notes (1996)
5. Lai, H.-J., Chen, Z.-H.: Even subgraphs of a graph, Combinatorics, Graph Theory and Algorithms, New Issues Press, Kalamazoo, pp. 221–226 (1999)