Z_3-connectivity of K_{1,3}-free graphs without induced cycle of length at least 5
Li, Xiangwen ; Ma, Jianqing
ARS MATHEMATICA CONTEMPORANEA, Tome 11 (2015), / Harvested from ARS MATHEMATICA CONTEMPORANEA
link
link
link

Jaeger et al. conjectured that every 5-edge-connected graph is Z_3-connected.  In this paper, we prove that every 4-edge-connected K_{1, 3}-free graph without any induced cycle of length at least 5 is Z_3-connected, which partially generalizes the earlier results of Lai [Graphs and Combin. 16 (2000) 165-176] and Fukunaga [Graphs and Combin. 27 (2011) 647-659].

Publié le : 2015-01-01
DOI : https://doi.org/10.26493/1855-3974.733.105 
@article{733,
     title = {Z\_3-connectivity of K\_{1,3}-free graphs without induced cycle of length at least 5},
     journal = {ARS MATHEMATICA CONTEMPORANEA},
     volume = {11},
     year = {2015},
     doi = {10.26493/1855-3974.733.105},
     language = {EN},
     url = {http://dml.mathdoc.fr/item/733}
}

Li, Xiangwen; Ma, Jianqing. Z_3-connectivity of K_{1,3}-free graphs without induced cycle of length at least 5. ARS MATHEMATICA CONTEMPORANEA, Tome 11 (2015) . doi : 10.26493/1855-3974.733.105. http://gdmltest.u-ga.fr/item/733/