Funder
National Natural Science Foundation of China
Natural Science Foundation of Fujian Province, China
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference27 articles.
1. Aldred, R.E.L., Hemminger, R.L., Ota, K.: The 3-connected graphs having a longest cycle containing only three contractible edges. J. Graph Theory 17, 361–371 (1993)
2. Aldred, R.E.L., Hemminger, R.L., Yu, X.: The 3-connected graphs with a maximum matching containing precisely one contractible edge. J. Graph Theory 18, 37–50 (1994)
3. Aldred, R.E.L., Hemminger, R.L., Yu, X.: Maximum matchings in 3-connected graphs contain contractible edges. Australas. J. Comb. 6, 23–34 (1992)
4. Ando, K., Enomoto, H., Saito, A.: Contractible edges in 3-connected graphs. J. Comb. Theory Ser. B 42, 87–93 (1987)
5. Barnette, D.W., Grunbaum, D.B.: On Steinitz’s theorem concerning convex 3-polytopes and on some properties of planar graph. In: Many Facets of Graph Theory. Lecture Notes in Mathematics, vol. 110, pp. 27–40 (1969)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献