Funder
National Natural Science Foundation of China
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference28 articles.
1. Abeledo H, Atkinson GW (2010) A min-max theorem for plane bipartite graphs. Discrete Appl Math 158:375–378
2. Bondy JA, Murty USR (1976) Graph theory with applications. American Elsevier, New York, Macmillan, London
3. Cai J, Zhang H (2012) Global forcing number of some chemical graphs. MATCH Commun Math Comput Chem 67:289–312
4. De Carvalho MH, Kothari N, Wang X, Lin Y (2020) Birkhoff-Von Neumann graphs that are PM-compact. SIAM J Discrete Math 34:1769–1790
5. Chan W, Xu S, Nong G (2015) A linear-time algorithm for computing the complete forcing number and the Clar number of catacondensed hexagonal systems. MATCH Commun Math Comput Chem 74:201–216
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献