호남수학학술지 (Honam Mathematical Journal)

  • 제27권4호
  • /
  • Pages.551-559
  • /
  • 2005
  • /
  • 1225-293X(pISSN)
  • /
  • 2288-6176(eISSN)
호남수학회 (The Honam Mathematical Society)
권호 표지

THE CHROMATIC NUMBER OF SOME PERMUTATION GRAPHS OVER SOME GRAPHS

  • LEE, JAEUN (Department of Mathematics Yeungnam University) ;
  • SHIN, YOUNG-HEE (Department of Mathematics Yeungnam University)
  • 투고 : 2005.08.27
  • 발행 : 2005.12.25
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

A permutation graph over a graph G is a generalization of both a graph bundle and a graph covering over G. In this paper, we characterize the F-permutation graphs over a graph whose chromatic numbers are 2. We determine the chromatic numbers of $C_n$-permutation graphs over a tree and the $K_m$-permutation graphs over a cycle.

키워드

과제정보

연구 과제 주관 기관 : KRF

참고문헌

  1. A first course in discrete mathmatics Anderson, I.
  2. Discrete Math. v.18 Generating all graph coverings by permultation voltage assignments Gross, J.;Tucker, T.
  3. Bull. Austral. Math. Soc. v.59 Bipartite graph bundles with connected fiber Hong, S.;Kwak, J.;Lee, J.
  4. Canad. j. Math. v.XLII Isomorphism classes of graph bundles Kwak, J.;Lee, J.
  5. ARS Com. v.50 Isomorhpism classes of bipartite cycle permutation graphs Kwak, J.;Lee, J.
  6. Discrete Math. v.138 The chromatic numbers of graph bundles over cycles Klavzar, S.;Mohar, B.
  7. Comm. of the Korean Math. Soc. v.10 On permutation graphs over a graph Lee, J.;Sohn, M.
  8. Europ. J. Combinatorics v.9 The maximum genus of graph bundles Mohar, B.;Pisanski, T.;Skoviera, M.