Strongly pan-factorial property in cages

A (k; g)-graph is a k-regular graph with girth g. A (k; g)-cage is a (k; g)-graph with the least number of vertices. In this note, we show that (k; g)-cage has an r-factor of girth at least g containing or

• Type: Journal
• Year: 2008
• Where: ARSCOM
• Authors: Guizhen Liu, Qinglin Yu
• Keywords: ARSCOM 2008, K-regular Graph, Show