The strong chromatic index of complete cubic Halin graphs

Wai Chee SHIU*, W. K. Tam

*Corresponding author for this work

Research output: Contribution to journalJournal articlepeer-review

17 Citations (Scopus)


A complete cubic Halin graph is a cubic Halin graph whose characteristic tree is a complete cubic tree, in which all leaves are at the same distance from the root vertex. In this work, we determine the strong chromatic index of the complete cubic Halin graph.

Original languageEnglish
Pages (from-to)754-758
Number of pages5
JournalApplied Mathematics Letters
Issue number5
Publication statusPublished - May 2009

Scopus Subject Areas

  • Applied Mathematics

User-Defined Keywords

  • Complete cubic Halin graph
  • Cubic tree
  • Edge-coloring
  • Halin graph
  • Strong chromatic index


Dive into the research topics of 'The strong chromatic index of complete cubic Halin graphs'. Together they form a unique fingerprint.

Cite this