an:04170932
Zbl 0712.05027
Teo, C. P.; Koh, K. M.
The chromaticity of complete bipartite graphs with at most one edge deleted
EN
J. Graph Theory 14, No. 1, 89-99 (1990).
00173185
1990
j
05C15
chromatic polynomials; bipartitie graphs; chromatically unique
The chromatic polynomial of a graph G is denoted by P(G,\(\lambda\)). Two graphs are chromatically equivalent if they have the same chromatic polynomials. A graph G is said to be chromatically unique if every graph H with \(P(G,\lambda)=P(H,\lambda)\) is isomorphic with G.
The paper concerns with the characterization of chromatically unique graphs. All complete bipartitie graphs K(p,q), \(2\leq p\leq q,\) are chromatically unique. All graphs obtained from a complete bipartite graph K(p,q) by deleting one edge, where \(3\leq p\leq q\), are also chromatically unique. These results prove a conjecture of Salzberg, L??pez, and Giudici.
Open questions concern the chromaticity of \(K(p,q)-\{e_ 1,e_ 2\}\) with \(4\leq p\leq q\) \((e_ 1,e_ 2\) are two distinct edges) and of \(K(p,q)+e\) with \(2\leq p\leq q\) (e is a new edge joining two vertices in a partite set).
U.Baumann