Skip to main content
SpringerLink
Log in

Cycles with Prescribed and Forbidden Sets of Elements in Cubic Graphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract.

 A necessary and sufficient condition for the existence of a cycle containing a set of three vertices and an edge excluding another edge is obtained for 3-connected cubic graphs by means of canonical contractions. A necessary and sufficient condition is also obtained for a cyclically 4-connected cubic graph to have a cycle that contains a set of four vertices and that avoids another vertex.

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. University of Natal, Pietermaritzburg, South Africa, , , , , , ZM

    Sheng Bau

Authors
  1. Sheng Bau
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: October 4, 1999 Final version received: June 14, 2000

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bau, S. Cycles with Prescribed and Forbidden Sets of Elements in Cubic Graphs. Graphs Comb 18, 201–208 (2002). https://doi.org/10.1007/s003730200013

Download citation

  • Issue Date:

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

Search

Navigation