Z_3-connectivity of K_{1,3}-free graphs without induced cycle of length at least 5

Xiangwen Li, Jianqing Ma

Abstract


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].

Keywords


Z_3-connectivity, K_{1, 3}-free, nowhere-zero 3-flow

Full Text:

PDF ABSTRACTS (EN/SI)


DOI: https://doi.org/10.26493/1855-3974.733.105

ISSN: 1855-3974

Issues from Vol 6, No 1 onward are partially supported by the Slovenian Research Agency from the Call for co-financing of scientific periodical publications