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].
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
