Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-19T05:13:16.242Z Has data issue: false hasContentIssue false

Anticritical graphs

Published online by Cambridge University Press:  24 October 2008

Frank Harary
Affiliation:
University of Michigan
Carsten Thomassen
Affiliation:
Aarhus University
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The term ‘critical graph’ has been used most frequently to mean a graph such that the removal of any line decreases the chromatic number. This can be generalized to define a graph G to be ‘critical (μ)’ for an arbitrary invariant, μ if, for each line e, μ(G – e) ≠ μ(G). Analogously we may consider any line e which joins two points not already adjacent in G and define G as ‘anticritical (μ)’ if μ(G + e) ≠ μ(G). Anticritical graphs are investigated here with respect to the following invariants: chromatic number, line-chromatic number, point-connectivity, line-connectivity, point-independence number, line-independence number, diameter, radius, and cyclability number.

Information

Type
Research Article
Copyright
Copyright © Cambridge Philosophical Society 1976