๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Some families of chromatically unique bipartite graphs

โœ Scribed by Xiebin Chen

Book ID
108316188
Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
287 KB
Volume
184
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The chromatic uniqueness of complete bip
The chromatic uniqueness of complete bipartite graphs
โœ Shaoji Xu ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 585 KB

Xu, S., The chromatic uniqueness of complete bipartite graphs, Discrete Mathematics 94 (1991) 153-159. This paper is partitioned into two parts. In the first part we determine the maximum number of induced complete bipartite subgraphs in graphs with some given conditions. Using a theorem given in th

Classes of chromatically unique graphs
Classes of chromatically unique graphs
โœ Mieczysล‚aw Borowiecki; Ewa Drgas-Burchardt ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 263 KB
Two classes of chromatically unique grap
Two classes of chromatically unique graphs
โœ K.M. Koh; B.H. Goh ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 563 KB

## Let P(G; A) denote the chromatic polynomial of a graph G. G is chromatically unique if G is isomorphic to H for any graph H with P(H; A) = P(G; A). In this paper, we provide two new classes of chromatically unique graphs.

On chromatic uniqueness of two infinite
On chromatic uniqueness of two infinite families of graphs
โœ Feng-Ming Dong ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 229 KB ๐Ÿ‘ 1 views

## Abstract 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 chr