Esperet, L.; Mazzuoccolo, G. (2014), On cubic bridgeless graphs whose edge-set cannot be covered by four perfect matchings, Journal of Graph Theory, 77 (2): 144—157, arXiv:1301.6926, doi:10.1002/jgt.21778, MR3246172.
arxiv.org
Esperet, L.; Mazzuoccolo, G. (2014), On cubic bridgeless graphs whose edge-set cannot be covered by four perfect matchings, Journal of Graph Theory, 77 (2): 144—157, arXiv:1301.6926, doi:10.1002/jgt.21778, MR3246172.
Isaacs, R. (1975), Infinite families of nontrivial trivalent graphs which are not Tait colorable, Amer. Math. Monthly, Mathematical Association of America, 82 (3): 221—239, doi:10.2307/2319844, JSTOR2319844.
Esperet, L.; Mazzuoccolo, G. (2014), On cubic bridgeless graphs whose edge-set cannot be covered by four perfect matchings, Journal of Graph Theory, 77 (2): 144—157, arXiv:1301.6926, doi:10.1002/jgt.21778, MR3246172.
ijcsns.org
paper.ijcsns.org
Punnim, Narong; Saenpholphat, Varaporn; Thaithae, Sermsri (2007), Almost Hamiltonian cubic graphs(PDF), International Journal of Computer Science and Network Security, 7 (1): 83—86, архів оригіналу(PDF) за 22 листопада 2010, процитовано 5 червня 2016
jstor.org
Isaacs, R. (1975), Infinite families of nontrivial trivalent graphs which are not Tait colorable, Amer. Math. Monthly, Mathematical Association of America, 82 (3): 221—239, doi:10.2307/2319844, JSTOR2319844.
Punnim, Narong; Saenpholphat, Varaporn; Thaithae, Sermsri (2007), Almost Hamiltonian cubic graphs(PDF), International Journal of Computer Science and Network Security, 7 (1): 83—86, архів оригіналу(PDF) за 22 листопада 2010, процитовано 5 червня 2016