Premium
On chromatic uniqueness of two infinite families of graphs
Author(s) -
Dong FengMing
Publication year - 1993
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190170312
Subject(s) - combinatorics , bipartite graph , mathematics , disjoint sets , chromatic scale , uniqueness , graph , foster graph , discrete mathematics , cograph , friendship graph , 1 planar graph , graph power , chordal graph , line graph , mathematical analysis
In this paper, it is proven that for each k ≥ 2, m ≥ 2, the graph Θ k ( m,…,m ), which consists of k disjoint paths of length m with same ends is chromatically unique, and that for each m, n , 2 ≤ m ≤ n , the complete bipartite graph K m,n is chromatically unique. © 1993 John Wiley & Sons, Inc.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom