Skip to main content
SpringerLink
Log in

Non-Bicritical Critical Snarks

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

 Snarks are cubic graphs with chromatic index χ′=4. A snark G is called critical if χ′ (G−{v,w})=3 for any two adjacent vertices v and w, and it is called bicritical if χ′ (G−{v,w})=3 for any two vertices v and w. We construct infinite families of critical snarks which are not bicritical. This solves a problem stated by Nedela and Škoviera.

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. Universität Bielefeld, Fakultät für Mathematik, Postfach 100131, 33501 Bielefeld, Germany. e-mail: steffen@mathematik.uni-bielefeld.de, , , , , , DE

    Eckhard Steffen

Authors
  1. Eckhard Steffen
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Revised: January 11, 1999

Rights and permissions

Reprints and permissions

About this article

Cite this article

Steffen, E. Non-Bicritical Critical Snarks. Graphs Comb 15, 473–480 (1999). https://doi.org/10.1007/s003730050054

Download citation

  • Issue Date:

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

Keywords

Search

Navigation