Loading...
A note on graceful graphs with large chromatic numbers
Mahmoody, A ; Sharif University of Technology | 2009
183
Viewed
- Type of Document: Article
- Publisher: 2009
- Abstract:
- A graceful labeling of a graph G with m edges is a function f : V(G) → {0,⋯, m} such that distinct vertices receive distinct numbers and {|f(u) - f(v)| : uv ∈ E(G)} = {1,⋯, m}. A graph is graceful if it has a graceful labeling. In [1] this question was posed: "Is there an n-chromatic graceful graph for n ≥ 6?". In this paper it is shown that for any natural number n, there exists a graceful graph G with χ(G) = n
- Keywords:
- Labeling ; Graph in graph theory ; Antimagic total
- Source: Ars Combinatoria ; Volume 90 , 2009 , Pages 423-424 ; 03817032 (ISSN)
- URL: http://www.combinatorialmath.ca/ArsCombinatoria/Vol90.html