Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

List Coloring of some Cayley graphs using Kernel perfections

Prajnanaswaroopa S

Abstract

In this paper, we try to determine exact or bounds on the choosability, or list chromatic numbers of some Cayley graphs, typically some Unitary Cayley graphs and Cayley graphs on Dihedral groups.

List Coloring of some Cayley graphs using Kernel perfections

Abstract

In this paper, we try to determine exact or bounds on the choosability, or list chromatic numbers of some Cayley graphs, typically some Unitary Cayley graphs and Cayley graphs on Dihedral groups.
Paper Structure (4 sections, 5 theorems)

This paper contains 4 sections, 5 theorems.

Table of Contents

  1. Abstract
  2. Introduction
  3. Circulant graphs
  4. Cayley graphs on Dihedral groups

Key Result

Lemma 1

If we can orient a perfect graph $G$ in a kernel solvable manner with maximum outdegree $k$, then $ch(G)\le k+1$.

Theorems & Definitions (12)

  • Lemma 1
  • proof
  • Theorem 1
  • proof
  • Theorem 2
  • proof
  • Theorem 3
  • proof
  • proof
  • Theorem 4
  • ...and 2 more