Dong, F. M.

Preferred name
Dong, F. M.
Email
fengming.dong@nie.edu.sg
Department
Mathematics & Mathematics Education (MME)
Personal Site(s)
ORCID

Filters

20041
Reset filters

Settings

Now showing 1 - 1 of 1
  • Thumbnail Image
    Publication
    Open Access
    Chromatically unique multibridge graphs
    (Electronic Journal of Combinatorics, 2004)
    Dong, F. M. 
    ;
    Teo, Kee Leong
    ;
    Little, Charles H. C.
    ;
    Hendy, Michael
    ;
    Koh, Khee Meng
    Let (a1, a2, · · · , ak) denote the graph obtained by connecting two distinct vertices with k independent paths of lengths a1, a2, · · · , ak respectively. Assume that 2 ≤ a1 ≤ a2 ≤ · · · ≤ ak. We prove that the graph θ (a1, a2, · · · , ak) is chromatically unique if ak < a1 +a2, and find examples showing that θ (a1, a2, · · · , ak) may not be chromatically unique if ak = a1 + a2.
      228  158