Pseudo-Hamiltonian-connected graphs

Discrete Applied Mathematics

Volumn 100, Issue 3, 2000, Pages 145-153

  Chang, Gerard J ^a   Zhu, Xuding ^b  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

^b NATIONAL SUN YAT SEN UNIVERSITY   (Taiwan)

Author keywords

05C15; Pseudo edge; Pseudo Hamiltonian connected; Regular Hamiltonian walk; Regularizable; Vertex packing

Indexed keywords

EID: 0347933129     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00181-X     Document Type: Article

References (9)

1. Berge C. Regularizable graphs. Advances in graph theory, Ann. Discrete Math. 3:1978;11-19.
2. G. Chartrand, O.R. Oellermann, Applied and Algorithmic Graph Theory, McGraw-Hill, New York, 1993.
3. Chvátal V. Tough graphs and Hamiltonian circuits. Discrete Math. 5:1973;215-228.
4. Enomoto B., Jackson B., Katerinis P., Saito A. Toughness and the existence of. k -factors J. Graph Theory. 9:1985;87-95.
5. Nemhauser G.L., Trotter J.L.E. Vertex packing: structural properties and algorithms. Math. Program. 8:1975;232-248.
6. R. Nowakowski, personal communication.
7. Picard J.-C., Queyranne M. On the integer-valued variables in the linear vertex packing problem. Math. Program. 12:1977;97-101.
8. Plesnik J. The NP-completeness of the Hamiltonian cycle problem in bipartite cubic planar graphs. Acta Math. Uinv. Comen. 42/43 :1983;271-273.
9. Pulleyblank W.L. Minimum node covers and 2-bicritical graphs. Math. Program. 17:1979;91-103.