Home > Archive>Volume 23, Issue 1, 2006 >139-142
PDF HTML XML Export Cite reminder
On IC-colorings of Connected Graphs
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

O157.5

Fund Project:

  • Article
    • |
  • Figures
    • |
  • Metrics
    • |
  • Reference
    • |
  • Related
    • |
  • Cited by
    • |
  • Materials
    • |
  • Comments
    Abstract:

    证明了C4k∪Pn当n=k+2,2k+1,2k+2,2k+3,3k,3k+1时的优美性.

    Reference
    Related
    Cited by
Get Citation

宋庆华.一些图C4k∪P_n的优美性[J].华东交通大学学报,2006,23(1):139-142.
. On IC-colorings of Connected Graphs[J]. JOURNAL OF EAST CHINA JIAOTONG UNIVERSTTY,2006,23(1):139-142

Copy
Related Videos

Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:October 21,2005
  • Revised:
  • Adopted:
  • Online:
  • Published:
Article QR Code
You are the Visitors
Governed by：East China Jiaotong University
Sponsored by：East China Jiaotong University
Address：No. 808 Shuanggang East Street, Changbei Economic and Technological Development Zone, Nanchang City, Jiangxi Province. Room 808, Building 8, Jiaojiao, South Campus, East China Jiaotong University (330013)
Telephone：0791-87046655
® 2025 WebsiteCopyright