AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
Powered by AMiner. Clicking this button will take you away from SciOpen.
Home AIMS Mathematics Article
PDF (206.7 KB)
Cite
EndNote(RIS) BibTeX
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

Z 3 -connectivity of graphs with independence number at most 3

Chunyan Qin1, Xiaoxia Zhang2, Liangchen Li1( )
Department of Mathematics, Luoyang Normal University, Luoyang, China
Department of Mathematics, Xinyang Normal University, Xinyang, China
Show Author Information

Abstract

It was conjectured by Jaeger et al. that all 5-edge-connected graphs are Z 3 -connected. In this paper, we confirm this conjecture for all 5-edge-connected graphs with independence number at most 3.

Keywords

nowhere-zero flowsZ3-connectivityindependence number
CLC number: 05C21

References

【1】
【1】
 
 
Crossref Google Scholar
AIMS Mathematics
Volume 8 Issue 2,
February 2023
Pages 3204-3209
DOI: 10.3934/math.2023164

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Cite this Report
Close
Close
Cite this article:
Qin C, Zhang X, Li L. Z 3 -connectivity of graphs with independence number at most 3. AIMS Mathematics, 2023, 8(2): 3204-3209. https://doi.org/10.3934/math.2023164

13

Views

0

Downloads

0

Crossref

0

Web of Science

0

Scopus
Received: 28 August 2022
Revised: 01 November 2022
Accepted: 08 November 2022
Published: 15 February 2023
©2023 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0)