Toughness of $K_{a,t}$-minor-free graphs.

Chen, Guantao, et al. "Toughness of -minor-free graphs.." The Electronic Journal of Combinatorics [electronic only] 18.1 (2011): Research Paper P148, 6 p., electronic only-Research Paper P148, 6 p., electronic only. <http://eudml.org/doc/229231>.

@article{Chen2011,
author = {Chen, Guantao, Egawa, Yoshimi, Kawarabayashi, Ken-ichi, Mohar, Bojan, Ota, Katsuhiro},
journal = {The Electronic Journal of Combinatorics [electronic only]},
language = {eng},
number = {1},
pages = {Research Paper P148, 6 p., electronic only-Research Paper P148, 6 p., electronic only},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Toughness of -minor-free graphs.},
url = {http://eudml.org/doc/229231},
volume = {18},
year = {2011},
}

TY - JOUR
AU - Chen, Guantao
AU - Egawa, Yoshimi
AU - Kawarabayashi, Ken-ichi
AU - Mohar, Bojan
AU - Ota, Katsuhiro
TI - Toughness of -minor-free graphs.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2011
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 18
IS - 1
SP - Research Paper P148, 6 p., electronic only
EP - Research Paper P148, 6 p., electronic only
LA - eng
UR - http://eudml.org/doc/229231
ER -