1. An extremal problem on non-full colorable graphs
- Author
-
Lu, Changhong and Zhai, Mingqing
- Subjects
- *
DISCRETE mathematics , *MATHEMATICS , *COMPUTER systems , *ELECTRONIC data processing - Abstract
Abstract: For a given graph G of order n, a k--labelling is defined as a function such that when and when . The -labelling number of G, denoted by , is the smallest number k such that G has a k--labelling. The hole index of G is the minimum number of integers not used in a --labelling of G. We say G is full-colorable if ; otherwise, it will be called non-full colorable. In this paper, we consider the graphs with and , where m is a positive integer. Our main work generalized a result by Fishburn and Roberts [No-hole -colorings, Discrete Appl. Math. 130 (2003) 513–519]. [Copyright &y& Elsevier]
- Published
- 2007
- Full Text
- View/download PDF