A new result on [k, k + 1]-factors containing given hamiltonian cycles

Authors:
Guizhen Liu;Xuejun Pan;Jonathan Z. Sun
Affiliations:
School of Mathematical and System Sciences, Shandong University, Jinan, Shandong, China;School of Mathematical and System Sciences, Shandong University, Jinan, Shandong, China;School of Computer Science and Technology, Shandong University of Technology, Zibo, Shandong, China and School of Computing, University of Southern Mississippi, Hattiesburg, MS
Venue:
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Year:
2010

Citing 6
Cited 0

Hamiltonian k-factors in graphs

Journal of Graph Theory
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Graph Theory With Applications

Graph Theory With Applications
The rainbow skip graph: a fault-tolerant constant-degree distributed data structure

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Factors and Factorizations of Graphs: Proof Techniques in Factor Theory

Factors and Factorizations of Graphs: Proof Techniques in Factor Theory
A linear time erasure-resilient code with nearly optimal recovery

IEEE Transactions on Information Theory - Part 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a sufficient condition, which guarantees that for arbitrary Hamiltonian cycle C, there exists a [k, k + 1]-factor containing C. This improves a previous result of Cai, Li, and Kano [7].