지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
초록· 키워드
오류제보하기
Let f be a function which assigns a positive integer f(v)to each vertex v 2 V (G), let r, s and t be non-negative integers. An f-coloring of G is an edge-coloring of G such that each vertex v 2 V (G) has at most f(v) incident edges colored with the same color. The minimum number of colors needed to f-color G is called the f-chromatic index of G and denoted by <수식>-coloring of a graph G is a mapping c from <수식> to the color set C = {0, 1,...,k-1}such that <수식> for every two adjacent vertices vi and vj ,<수식> for all vi 2 V (G), <수식> where α(vi) denotes the number of α-edges incident with the vertex vi and ei,ej are edges which are incident with vi but colored with different colors,<수식> for all pairs of incident vertices and edges. The minimum k such that G has an [r, s, t; f]-coloring with k colors is defined as the [r,s, t; f]-chromatic number and denoted by Χ_(r,s,t,f)(G). In this paper, we present some general bounds for [r, s, t; f]-coloring firstly. After that, we obtain some important properties under the restriction min{r, s, t} = 0 or min{r, s, t} = 1. Finally, we present some problems for further research.
목차
등록된 정보가 없습니다.
참고문헌 (9)
참고문헌 신청
A. Kemnitz / 2007 / [r; s; t]-colorings of graphs / Discrete Math 307 (2) : 199 ~ 207
F. Havet / 2008 / (p; 1)-total labelling of graphs / Discrete Math 308 (4) : 496 ~ 513
J. A. Bondy / 1976 / Graph Theory with Applications / American Elsevier Publishing Co., Inc
L. Dekar / 2008 / [r; s; t]-coloring of trees and bipartite graphs / Discrete Math
R. L. Brooks / 1941 / On colouring the nodes of a network / Proc. Cambridge Philos. Soc : 194 ~ 197
F. Havet / 2008 / (p; 1)-total labelling of graphs / Discrete Math 308 (4) : 496 ~ 513
J. A. Bondy / 1976 / Graph Theory with Applications / American Elsevier Publishing Co., Inc
L. Dekar / 2008 / [r; s; t]-coloring of trees and bipartite graphs / Discrete Math
R. L. Brooks / 1941 / On colouring the nodes of a network / Proc. Cambridge Philos. Soc : 194 ~ 197
이 논문의 저자 정보
최근 본 자료
댓글(0)
0