(IJCNS) International Journal of Computer and Network Security, 67

Vol. 2, No. 9, September 2010

Triple-Critical Graphs
Basheer Ahamed M., and Bagyam I

Department of Mathematics, Karunya University, Coimbatore-641114, Tamilnadu, INDIA

Abstract: A graph G = (V, E ) is said to be double-critical if

G is connected and the chromatic number of G decreases by 2
when any two adjacent vertices of G are removed. We extend
this concept to triple-critical graphs.
Mathematic Subject Classification 2010: 05C15.
Keywords: Complete graphs, Degree, Double-critical k-
chromatic graph, Complete decomposable graph, triple-critical
graphs.
1. Introduction
The double-critical graph conjecture is a special case of
Erdos-Lovasz Tihany conjecture [4], which states that for
any graph G = (V, E ) with χ ( G ) > ω ( G ) and any two
integers a , b ≥ 2 with a + b = χ ( G ) + 1 , there is a
partition (A, B) of the vertex set V(G) such that
χ ( G [ A]) ≥ a and χ ( G [ B]) ≥ b . The double-critical
graph conjecture is proved [2] which states that Kk is the
(only) double-critical k-chromatic graph. In this paper, we
extend the concept to triple-critical graphs and prove a
theorem.
2. Preliminaries
Throughout this paper, we assume that G = (V, E ) is a
finite, connected, undirected, simple graph. . The order and
size of a graph G is represented as n(G ) and m(G )
respectively. The degree of a vertex v is denoted by d (v).
The maximum degree of the graph G is denoted as ∆ (v)
and the minimum degree of the graph G is denoted as
δ (v). A graph G = (V, E ) is said to be a clique or a
complete graph if E = V × V. It is denoted as Kn , where
V = n . Further, the subgraph of G: V (G ) \ {x} is
denoted by G − x.
We summarize some notations and results which are
useful to develop the main results of this paper.
2.1 Definition [6].
A k-coloring of a graph G = (V, E ) is a function φ from
the vertex set V of G into a set c of cardinality k so that
φ (u ) ≠ φ (v) for every edge uv ∈ E (G ).
2.2 Definition [6].
A graph G is k-colorable if it has a k-coloring. The elements
of the set c are referred to as colors and a vertex v ∈ V ( G )
is said to be assigned the color φ ( v) by φ .
2.3 Definition [6].
The chromatic number, denoted by χ (G ) is the minimum
integer ‘k’ for which a graph G is k-colorable.
2.4 Theorem [3].
For any graph G = (V, E ) , we have χ (G ) ≤ Δ (G) +1.
2.5 Theorem [3].
For a complete graph G = (V, E ) , χ (G ) = Δ (G) +1.
2.6 Definition [6].
A graph G = (V, E ) is called vertex-critical or simply
critical if χ (G − v) < χ (G ) for every v ∈ V(G ).
2.7 Definition [7].
A graph G = (V, E ) is said to be double-critical if G is
connected and the chromatic number of G decreases by 2
when any two adjacent vertices of G are removed.
2.8 Definition [6].
A graph G = (V, E ) is said to be decomposable if it
consists of two disjoint non-empty subgraphs G1 and G2
together with all edges joining a vertex of G1 and a vertex
of G2 .
2.9 Theorem [5].
A k-critical graph with at most 2k − 2 vertices is always
decomposable.
2.10 Definition [1].
A graph G = (V, E ) is called complete decomposable if it
consists of two disjoint non-empty subgraphs G1 and G2
together with all the edges that join every vertex of G1 to
every vertex of G2 . Then, the complete decomposition of
the graph G is written as G = G1 ⊗ G2 .

2.11 Theorem [8].

68 (IJCNS) International Journal of Computer and Network Security,
Vol. 2, No. 9, September 2010

K5 is the only double - critical 5-chromatic graph. = χ (Ga ) + χ (Gb ) − 3. = χ (G ) − 3.

Therefore, χ (G − vi − v j − vk ) = χ (G ) − 3.
2.12 Theorem [2]. Hence, G is a triple-critical graph.
Kk is the (only) double-critical k-chromatic graph. Case 2: Ga = K2 and Gb = Kn , n > 2.

Sub-case 2(a): vi ∈ V (Ga ) and vi , v j ∈ V (Gb ).

3. Main Results
In this section, we extend the concept of double-critical Using (4), we have χ (Ga − vi ) = χ (Ga ) − 1 and
graphs to triple-critical graphs and prove a theorem. χ (Gb − v j − vk ) = χ (Gb ) − 2. Therefore, we have
3.1 Definition χ (G − vi − v j − vk ) = χ (Ga − vi ) + χ (Gb − v j − vk )
A graph G is said to be triple-critical if G is connected and = χ (G ) − 3. Thus; G is a triple-critical graph.
the chromatic number of G decreases by 3, when any 3 Sub-case 2(b):
vertices of G, which form a triangle are removed.
vi , v j ∈ V (Ga ) and vk ∈ V (Gb ).
3.2 Theorem
By case (1), χ (Ga − vi − v j ) = χ (Ga ) − 2 and
Let G be a complete decomposable graph and G1 and G2
χ (Gb − vk ) = χ (Gb ) − 1. Hence,
be the components of G. If G1 and G2 are complete
χ (G − vi − v j − vk ) = χ (Ga − vi − v j ) + χ (Gb − vk )
graphs on n-vertices, n ≥ 2, then, G is a triple-critical
= χ (G ) − 3. Therefore, G is a triple-critical graph.
graph.
Sub-case 2(c):
Proof:
Consider vi , v j , vk ∈V (Ga ) and no vertex from
By the theorem, Kk is the (only) double-critical k-
chromatic graph, it is clear that V (Gb ) is removed.
A complete graph on k vertices Kk , k ≥ 2 is a By (1), χ (Gb − vi − v j ) = χ (Gb ) − 2. The induced
double-critical graph. (1) graph Gb − vi − v j is a complete graph on n(Gb ) − 2
Since, the complete graph Kk is critical for every
vertices. Therefore,
k, Kk is a critical graph. χ (G − vi − v j − vk ) = χ (Ga ) + {[ χ (Gb ) − 2] − 1}
(2) = χ (Ga ) + χ (Gb ) − 3 = χ (G ) − 3.
Let G be a complete decomposable graph. Then,
Hence, G is a triple-critical graph.
χ (G ) = χ (G1 ) + χ (G2 )
(3) Case 3: Ga = Kn , n > 2 and Gb = Kn , n > 2.
Also, let G1 and G2 be the complete graphs Sub-case 3(a):
on n-vertices, n ≥ 2. Then, clearly from (1) and (2), G1 Let vi , v j ∈ V (Ga ) and vk ∈ V (Gb ). By case (1), G

and G2 are both critical and double-critical graphs. is a triple-critical graph.

Sub-case 3(b):
(4)
Let vi , v j , vk ∈V (Ga ) and no vertices from the
The components Ga and Gb , a ≠ b and a , b = 1, 2 will
component Gb is removed. By sub-case 2(c), G is a triple-
be of three cases.
Case 1: Ga = K2 and Gb = K2 . critical graph.
□
Case 2: Ga = K2 and Gb = Kn , n > 2.
Case 3: Ga = Kn , n > 2 and Gb = Kn , n > 2. We illustrate the above theorem with an example
for each case.
Let vi , v j , vk , i ≠ j ≠ k and vi , v j , vk ∈ V (G ) be
3.3 Example
the three vertices which are removed to verify triple-critical
property of the graph G. For case (1), Let G1 = K2 and G2 = K2 . Then, the graph

Case 1: Ga = K2 and Gb = K2 . G = G1 ⊗ G2 = K2 ⊗ K2 . Then, the chromatic number,

χ (G1 ) = 2, χ (G2 ) = 2 and χ (G ) = 4. After the
Let vi , v j ∈ V (Ga ) and vk ∈ V (Gb ). Then by (4),
removal of the three vertices,
χ (Ga − vi − v j ) = χ (Ga ) − 2 χ (G − va − vb − vc ) = χ (G1 − va − vb ) + χ (G2 − vc )
and χ (Gb − vk ) = χ (Gb ) − 1. Then we have, = χ (G1 ) − 2 + χ (G2 ) − 1 = 1. Therefore, G is triple-
χ (G − vi − v j − vk ) = χ (Ga ) − 2 + χ (Gb ) − 1. critical graph.
 (IJCNS) International Journal of Computer and Network Security, 69
3.4 Example
For subcase 2(a), when G1 = K2 and G2 = K5 ,
G = K2 ⊗ K5 . Then, the chromatic number, χ (G ) = 7,
χ (G1 ) = 2 and χ (G2 ) = 5. Removing a vertex
va ∈ V (G1 ) and two vertices vb , vc ∈ V (G2 ) , we get,
χ (G − va − vb − vc ) = χ (G1 − va ) + χ (G2 − vb − vc )
= 2 − 1 + 5 − 2 = 4. Hence, G = K7 is a triple-critical
graph.
3.5 Example
For subcase 2(b), when G1 = K2 and G2 = K5 ,
G = K2 ⊗ K5 . Then, the chromatic number, χ (G ) = 7,
χ (G1 ) = 2 and χ (G2 ) = 5. Removing two vertices from
G1 and a vertex from G2 , we get,
χ (G − va − vb − vc ) = χ (G1 − va − vb ) + χ (G2 − vc )
= χ (G1 ) − 2 + χ (G2 ) − 1 = 2 − 2 + 5 − 1 = 4. Hence,
G = K7 is a triple-critical graph.
3.6 Example
For subcase 2(c), when G1 = K2 and G2 = K5 ,
G = K2 ⊗ K5 . Then, the chromatic number, χ (G ) = 7,
χ (G1 ) = 2 and χ (G2 ) = 5. Removing no vertex from
G1 and three vertices from G2 , we get,
χ (G − va − vb − vc ) = χ (G1 ) + χ (G2 − va − vb − vc )
= χ (G1 ) + χ (G2 ) − 3 = 2 + 5 − 3 = 4.
Hence, G = K7 is triple-critical graph.
3.7 Example.
For subcase 3(a), when G1 = K3 and G2 = K6 ,
G = K3 ⊗ K6 = K9 . Then, the chromatic number,
χ (G ) = 9, χ (G1 ) = 3 and χ (G2 ) = 6. Removing two
vertices from G1 and one vertex from G2 , we get,
χ (G − va − vb − vc ) = χ (G1 − va − vb ) + χ (G2 − vc )
= χ (G1 ) − 2 + χ (G2 ) − 1 = 3 − 2 + 6 − 1 = 6.
Hence, G = K9 is triple-critical graph.
3.8 Example
For subcase 3(b), when G1 = K3 and G2 = K6 ,
G = K3 ⊗ K6 = K9 . Then, the chromatic number,
χ (G ) = 9, χ (G1 ) = 3 and χ (G2 ) = 6. Removing no
vertex from G1 and three vertices from G2 , we get,
χ (G − va − vb − vc ) = χ (G1 ) + χ (G2 − va − vb − vc )
= χ (G1 ) + χ (G2 ) − 3 = 3 + 6 − 3 = 6.
Vol. 2, No. 9, September 2010
Therefore, G = K9 is a triple-critical graph.
References
[1] M. Basheer Ahamed, I. Bagyam, Complete decomposable
graphs, communicated
[2] M. Basheer Ahamed, I. Bagyam, Double-critical k-
chromatic graphs, accepted
[3] V.K. Balakrishnan, Schaum’s outline of Theory and
Problems of Graph Theory. McGraw Hill, USA, 1997.
[4] P. Erdos, Problem 2. In theory of Graphs (Proc. Colloq.,
Tihany, 1966), pp. 361. Academic Press, New York,
1968.
[5] T. Gallai, Critical graphs, In Theory of Graphs and its
Applications (Proc. Sympos. Smolenice, 1963), Publ.
House Czechoslovak Acad. Sci., pp. 43-45, Prague,
1964.
[6] K. Kawarabayashi, A. Pederson, B. Toft, Double-critical
graphs and complete minors, 2008. [online].
Available:URL:http://arxiv.org/PS_cache/arxiv/pdf/0810
/0810.3133v1.pdf. [Accessed: Dec. 11, 2009].
[7] Matej Stehlik, Critical graphs, Ph.D. Thesis, University
of London, 2003.
[8] M. Stiebitz, K5 is the only double-critical 5-chromatic
graph. Discrete Math., 64: pp. 91-93, 1987.
Authors Profile
Basheer Ahamed M received the Ph,D
degree in Mathematics from
Bharathidasan University in 2005. He is
working as Associate Professor of
Mathematics in Karunya University,
Coimbatore, INDIA.
Bagyam I received the M.Sc degree in
Mathematics from University of Madras
in 2009. She is doing research in
Mathematics at Karunya University.