Ge, G. Et Al. 2015. A Complete Solution to Spectrum Problem for Five-Vertex Graphs with Application to Traffic Grooming in Optical Networks. JOURNAL OF COMBINATORIAL DESIGNS , vol.23 , 233-273.

Ge, G., Hu, S., Kolotoglu, E., & Wei, H., (2015). A Complete Solution to Spectrum Problem for Five-Vertex Graphs with Application to Traffic Grooming in Optical Networks. JOURNAL OF COMBINATORIAL DESIGNS , vol.23, 233-273.

Ge, Gennian Et Al. "A Complete Solution to Spectrum Problem for Five-Vertex Graphs with Application to Traffic Grooming in Optical Networks," JOURNAL OF COMBINATORIAL DESIGNS , vol.23, 233-273, 2015

Ge, Gennian Et Al. "A Complete Solution to Spectrum Problem for Five-Vertex Graphs with Application to Traffic Grooming in Optical Networks." JOURNAL OF COMBINATORIAL DESIGNS , vol.23, pp.233-273, 2015

Ge, G. Et Al. (2015) . "A Complete Solution to Spectrum Problem for Five-Vertex Graphs with Application to Traffic Grooming in Optical Networks." JOURNAL OF COMBINATORIAL DESIGNS , vol.23, pp.233-273.

@article{article, author={Gennian Ge Et Al. }, title={A Complete Solution to Spectrum Problem for Five-Vertex Graphs with Application to Traffic Grooming in Optical Networks}, journal={JOURNAL OF COMBINATORIAL DESIGNS}, year=2015, pages={233-273} }