Skip to main content
SpringerLink
Log in

Contractible Non-Edges in Triangle-Free Graphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

Thomassen has proved that every triangle-free k-connected graph contains a pair of adjacent vertices whose identification yields again a k-connected graph. We study the existence of a pair of nonadjacent vertices whose identification preserves k-connectivity. In particular, we present a reduction theorem for the class of all bipartite, k-connected graphs.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Institut für Mathematik (A), Universität Hannover, Welfengarten 1, D-30167 Hannover, Germany. e-mail: kriesell@math.uni-hannover.de, , , , , , DE

    Matthias Kriesell

Authors
  1. Matthias Kriesell
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Revised: January 7, 1999

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kriesell, M. Contractible Non-Edges in Triangle-Free Graphs. Graphs Comb 15, 429–439 (1999). https://doi.org/10.1007/s003730050051

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s003730050051

Keywords

Search

Navigation