Complete forcing numbers of catacondensed hexagonal systems-Reference-Cited by-同舟云学术

Complete forcing numbers of catacondensed hexagonal systems

Published:2013-05-15 Issue:4 Volume:29 Page:803-814
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Xu Shou-Jun,Zhang Heping,Cai Jinzhuan

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

http://link.springer.com/content/pdf/10.1007/s10878-013-9624-x.pdf

Reference25 articles.

1. Adams P, Mahdian M, Mahmoodian ES (2004) On the forced matching numbers of bipartite graphs. Discret Math 281:1–12

2. Afshani P, Hatami H, Mahmoodian ES (2004) On the spectrum of the forced matching number of graphs. Austral J Combin 30:147–160

3. Balakrishnan VK (1995) Theory and problems of combinatorics. Schaum’s Outline Series, McGraw-Hill

4. Cai J, Zhang H (2012) Global forcing number of some chemical graphs. MATCH Commun Math Comput Chem 67:289–312

5. Che Z, Chen Z (2011) Forcing on perfect matchings-A survey. MATCH Commun Math Comput Chem 66:93–136

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Complete forcing numbers of (4,6)-fullerenes;Discrete Applied Mathematics;2024-11

2. Complete forcing numbers of complete and almost-complete multipartite graphs;Journal of Combinatorial Optimization;2023-08-24

3. Complete forcing numbers of catacondensed phenylene systems;Filomat;2023

4. Complete forcing numbers of graphs;Ars Mathematica Contemporanea;2022-12-13

5. The research and progress of the enumeration of lattice paths;Frontiers of Mathematics;2022-10