Skip to main content
Log in

Contractible Edges and Contractible Triangles in a 3-Connected Graph

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

Let G be a 3-connected graph. An edge (a triangle) of G is said to be a 3-contractible edge (a 3-contractible triangle) if the contraction of it results in a 3-connected graph. We denote by \(E_{c}(G)\) and \(\mathcal {T}_{c}(G)\) the set of 3-contractible edges of G and the set of 3-contractible triangles of G, respectively. We prove that if \(|V(G)|\ge 7\), then \(|E_{c}(G)|+ \frac{15}{14}|\mathcal {T}_{c}(G)|\ge \frac{6}{7}|V(G)|.\) We also determine the extremal graphs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  1. Ando, K., Enomoto, H., Saito, A.: Contractible edges in \(3\)-connected graphs. J. Combin. Theory (B) 42, 87–93 (1987)

    Article  MathSciNet  Google Scholar 

  2. Ando, K., Iwase, T.: The number of vertices of degree 5 in a contraction-critically 5-connected graph. Discrete Math. 311, 1925–1939 (2011)

    Article  MathSciNet  Google Scholar 

  3. Halin, R.: Zur Theorie der \(n\)-fach zudammenhängende Graphen. Abh. Math. Sem. Univ. Hamburg 33, 133–164 (1969)

    Article  MathSciNet  Google Scholar 

  4. Kriesell, M.: A survey on contractible edges in graphs of a prescribed vertex connectivity. Graphs Combin. 18, 1–30 (2002)

    Article  MathSciNet  Google Scholar 

  5. Lovasz, L.: Combinatorial problems and exercises, 2nd edn. AMS Chelsea Publishing, Providence (2007)

    MATH  Google Scholar 

  6. Tutte, W.T.: A theory of \(3\)-connected graphs. Indag. Math. 23, 441–455 (1961)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The authors would like to thank Professor Katsuhiro Ota for his valuable comments. The authors are also grateful to the referee, whose suggestions have greatly improved the presentation of the paper. This work is supported by JSPS KAKENHI Grant Number JP18H05291.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kiyoshi Ando.

Additional information

Dedicated to Professor Hikoe Enomoto and Professor Ei-ichi Bannai on the occasion of the 75th anniversary of their birth.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ando, K., Egawa, Y. Contractible Edges and Contractible Triangles in a 3-Connected Graph. Graphs and Combinatorics 37, 1807–1821 (2021). https://doi.org/10.1007/s00373-021-02354-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-021-02354-1

Keywords

Mathematics Subject Classification

Navigation