Decycling Graphs

Journal of Graph Theory

Volumn 25, Issue 1, 1997, Pages 59-77

  Beineke, Lowell W ^a   Vandell, Robert C ^b  

^a INDIANA UNIVERSITY PURDUE UNIVERSITY FORT WAYNE   (United States)

^b WESTERN MICHIGAN UNIVERSITY   (United States)

Author keywords

Cycle; Forest; Grid; Hypercube

Indexed keywords

EID: 0031528348     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199705)25:1<59::AID-JGT4>3.0.CO;2-H     Document Type: Article

References (6)

1. D. W. Davies, Longest "separated" paths and loops in an N cube. IEEE Trans. Electronic Computers 14 (1965), 261.
2. P Erdos, M. Saks, and V. T. Sós, Maximum induced trees in graphs, J. Combin. Theory Ser. B. 41 (1986), 61-79.
3. W. H. Kautz, Unit-distance error-checking codes. IRE Trans. Electronic Computers 7 (1958), 179-180.
4. V. L. Klee, What is the maximum length of a d-dimensional snake? Amer. Math. Monthly 77 (1970), 63-65.
5. F. J. MacWilliams and N. J. A. Sloane, The theory of error-correcting codes, North-Holland, Amsterdam (1977).
6. R. J. Wilson, Introduction to graph theory (4th ed.), Addison-Wesley/Longman, Reading, MA (1996).