Contractible Edges in 3-Connected Cubic Graphs-Reference-Cited by-同舟云学术

Contractible Edges in 3-Connected Cubic Graphs

Published:2021-07-08 Issue:03 Volume:31 Page:2150014
ISSN:0129-6264
Container-title:Parallel Processing Letters
language:en
Short-container-title:Parallel Process. Lett.

Author:

Kou Shuai¹^ORCID,Qin Chengfu²,Yang Weihua¹

Affiliation:

1. Department of Mathematics, Taiyuan University of Technology, Taiyuan Shanxi-030024, China

2. Department of Mathematics, Guangxi Teachers Education University, Nanning, China

Abstract

An edge [Formula: see text] in a 3-connected graph [Formula: see text] is contractible if the contraction [Formula: see text] is still [Formula: see text]-connected. Let [Formula: see text] be the set of contractible edges of [Formula: see text], [Formula: see text] be the set of vertices adjacent to three vertices of a triangle △. It has been proved that [Formula: see text] in a 3-connected graph [Formula: see text] of order at least 5. In this note [Formula: see text] is a 3-connected cubic graph containing [Formula: see text] triangles, at least [Formula: see text] vertices and with every [Formula: see text] an independent set. Then [Formula: see text]. This is a bound better than [Formula: see text] under some conditions.

Funder

National Natural Science Foundation of China-Yunnan Joint Fund

Publisher

World Scientific Pub Co Pte Lt

Subject

Hardware and Architecture,Theoretical Computer Science,Software

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129626421500146

Reference6 articles.

1. Graph Theory with Applications

2. A theory of 3-connected graphs

3. Zur Theorie dern-fach zusammenhängenden Graphen

4. Contractible edges in triangle-free graphs

5. Contractible edges in 3-connected graphs