2021
DOI: 10.48550/arxiv.2107.09756
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Decomposition of cubic graphs with cyclic connectivity 5

Abstract: Let G be a cyclically 5-connected cubic graph with a 5-edge-cut separating G into two cyclic components G 1 and G 2 . We prove that each component G i can be completed to a cyclically 5-connected cubic graph by adding three vertices, unless G i is a cycle of length five. Our work extends similar results by Andersen et al. for cyclic connectivity 4 from 1988.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 5 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?