A polynomial algorithm for finding the minimum feedback vertex set of a 3-regular simple graph

Acta Mathematica Scientia

Volumn 19, Issue 4, 1999, Pages 375-381

  Deming, Li ^a   Yanpei, Liu ^b  

^a CAPITAL NORMAL UNIVERSITY   (China)

^b BEIJING JIAOTONG UNIVERSITY   (China)

Author keywords

3 regular graph; Adjacency matching; Feedback vertex set; Maximum genus; Nonseparating independent number

Indexed keywords

EID: 0040887697     PISSN: 02529602     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0252-9602(17)30520-9     Document Type: Article

References (8)

1. Garey M R, Johnson D S. The rectilinear steiner tree problem is NP-complete. SIAM J Appl Math, 1977, 32: 826-834
2. Gross J L, Tucker T W. Topological Graph Theory. New York: Wiley-Interscience, 1987. 35-56
3. Huang Y. On the maximum genus of graphs.[Ph D Thesis] Beijing: Northern Jiaotong University, 1996
4. Liu J. Zhao C. A new bound on the feedback vertex set in cubic graphs. Discr Math, 1996,148: 119-131
5. Nordhaus E A, Ringeisen R D, Stewart B M, White A T. A Kuratowiski-type theorem for maximum genus of a graph. J Combin Theory Ser B, 1972,12: 260-267
6. Speckenmeyer E. On the feedback vertex sets and nonseparating independent sets in cubic graphs. J Graph Theory, 1988,12: 405-412
7. Zhang M, Lu X. On the maximum induced forests of a connected cubic graph without triangles. Discr Math, 1990,85: 89-96
8. Xuong N H, How to determine the maximum genus of a graph. J Combin Theory Ser B, 1979,26: 216-225