Iyad A. Kanj, Fenghui Zhang. On the Independence Number of Graphs with Maximum Degree 3. In Petr Kolman, Jan Kratochvíl, editors, Graph-Theoretic Concepts in Computer Science - 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21-24, 2011. Revised Papers. Volume 6986 of Lecture Notes in Computer Science, pages 238-249, Springer, 2011. [doi]
@inproceedings{KanjZ11-0,
title = {On the Independence Number of Graphs with Maximum Degree 3},
author = {Iyad A. Kanj and Fenghui Zhang},
year = {2011},
doi = {10.1007/978-3-642-25870-1_22},
url = {http://dx.doi.org/10.1007/978-3-642-25870-1_22},
researchr = {https://researchr.org/publication/KanjZ11-0},
cites = {0},
citedby = {0},
pages = {238-249},
booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21-24, 2011. Revised Papers},
editor = {Petr Kolman and Jan Kratochvíl},
volume = {6986},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-25869-5},
}