Full-Text Search:
Home|About CNKI|User Service|中文
Add to Favorite Get Latest Update

ON THE ADJACENT STRONG EDGE CHROMATIC NUMBER OF OUTER PL ANAR GRAPHS WITH Δ(G)≤ 4

L iu L inzhong (Dept.of Management Engineering,Lanzhou Railway Institute,Lanzhou 730 0 70 ) Zhang Zhongfu (Institute of Applied Mathematics,Lanzhou Railway Institute,Lanzhou 730 0 70 ) Wang Jianfang (Institute of Applied Mathematics,China Academia Si  
In this paper,itis raised a conjecture that for a 2 - connected graphs G( G≠ C5) with |V( G) |≥ 3 ,thenΔ ( G)≤χ′as( G)≤Δ ( G) +2 ,and proved that if G is a 2 - connected outer planar graph withΔ( G)≤ 4 ,thenΔ( G)≤ χ′as( G)≤ Δ( G) +1andχ′as( G) = Δ( G) +1iff there are two or more adjacent maximum degree vertices.
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©CNKI All Rights Reserved