The strong chromatic index of complete cubic Halin graphs

W. C. Shiu; W. K. Tam

doi:10.1016/j.aml.2008.08.019

The strong chromatic index of complete cubic Halin graphs

W. C. Shiu^*
, W. K. Tam

^*Corresponding author for this work

Department of Mathematics

Research output: Contribution to journal › Journal article › peer-review

21 Citations (Scopus)

Abstract

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 language	English
Pages (from-to)	754-758
Number of pages	5
Journal	Applied Mathematics Letters
Volume	22
Issue number	5
DOIs	https://doi.org/10.1016/j.aml.2008.08.019
Publication status	Published - May 2009

User-Defined Keywords

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

Access to Document

10.1016/j.aml.2008.08.019

Cite this

@article{f7e3dd99c1914a0493e724e722b4d0e0,

title = "The strong chromatic index of complete cubic Halin graphs",

abstract = "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.",

keywords = "Complete cubic Halin graph, Cubic tree, Edge-coloring, Halin graph, Strong chromatic index",

author = "Shiu, \{W. C.\} and Tam, \{W. K.\}",

year = "2009",

month = may,

doi = "10.1016/j.aml.2008.08.019",

language = "English",

volume = "22",

pages = "754--758",

journal = "Applied Mathematics Letters",

issn = "0893-9659",

publisher = "Elsevier Ltd.",

number = "5",

}

TY - JOUR

T1 - The strong chromatic index of complete cubic Halin graphs

AU - Shiu, W. C.

AU - Tam, W. K.

PY - 2009/5

Y1 - 2009/5

N2 - 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.

AB - 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.

KW - Complete cubic Halin graph

KW - Cubic tree

KW - Edge-coloring

KW - Halin graph

KW - Strong chromatic index

UR - https://www.scopus.com/pages/publications/62249177016

U2 - 10.1016/j.aml.2008.08.019

DO - 10.1016/j.aml.2008.08.019

M3 - Journal article

AN - SCOPUS:62249177016

SN - 0893-9659

VL - 22

SP - 754

EP - 758

JO - Applied Mathematics Letters

JF - Applied Mathematics Letters

IS - 5

ER -

The strong chromatic index of complete cubic Halin graphs

Abstract

User-Defined Keywords

Access to Document

Other files and links

Fingerprint

Cite this