Jixing Wang. Infinite Family from Each Vertex k-Critical Graph without Any Critical Edge. In Ding-Zhu Du, Xiaodong Hu, Panos M. Pardalos, editors, Combinatorial Optimization and Applications, Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009. Proceedings. Volume 5573 of Lecture Notes in Computer Science, pages 238-248, Springer, 2009. [doi]
@inproceedings{Wang09:21,
title = {Infinite Family from Each Vertex k-Critical Graph without Any Critical Edge},
author = {Jixing Wang},
year = {2009},
doi = {10.1007/978-3-642-02026-1_22},
url = {http://dx.doi.org/10.1007/978-3-642-02026-1_22},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/Wang09%3A21},
cites = {0},
citedby = {0},
pages = {238-248},
booktitle = {Combinatorial Optimization and Applications, Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009. Proceedings},
editor = {Ding-Zhu Du and Xiaodong Hu and Panos M. Pardalos},
volume = {5573},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-02025-4},
}