Title of article
Vertex-distinguishing edge-colorings of 2-regular graphs Original Research Article
Author/Authors
P. Wittmann، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1996
Pages
13
From page
265
To page
277
Abstract
Aigner et al., proved that for the irregular coloring number c(G) of a simple 2-regular graph of order n the inequality c(G) ⩽ √8n + O(1) holds. Here it is shown that c(G) ⩽ √2n + O(1).
Keywords
Irregularity strength , Steiner triple system , Decomposition
Journal title
Discrete Applied Mathematics
Serial Year
1996
Journal title
Discrete Applied Mathematics
Record number
884656
Link To Document