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

Adjoint polynomials and chromatically unique graphs

โœ Scribed by Ru-Ying Liu


Book ID
108316096
Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
320 KB
Volume
172
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Chromatically unique graphs
โœ Chong-Yun Chao; Earl Glen Whitehead Jr. ๐Ÿ“‚ Article ๐Ÿ“… 1979 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 493 KB
Classification of chromatically unique g
โœ Nian-Zu Li; Earl Glen Whitehead Jr.; Shao-Ji Xu ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 329 KB ๐Ÿ‘ 1 views

Frucht and Giudici classified all graphs having quadratic a-polynomials. Here w e classify all chromatically unique graphs having quadratic (Tpolynomials.

On ฯƒ-polynomials and a class of chromati
โœ Qingyan Du ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 655 KB

Du, Q., On o-polynomials and a class of chromatically unique graphs, Discrete Mathematics 115 (1993) 153-165. Let cr(G)=C:,,aicr '-' be the u-polynomial of a graph G. We ask the question: When k and a, are given, what is the largest possible value of ai(O < i < k) for any graph G? In this paper, thi

On path-chromatically unique graphs
โœ Esperanza Blancaflor Arugay; Severino Villanueva Gervacio ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 230 KB

The least number of colors needed to color the vertices of a graph G such that the vertices in each color class induces a linear forest is called the path-chromatic number of G, denoted by Zoo (G). If all such colorings of the vertices of G induce the same partitioning of the vertices of G, we say

Classes of chromatically unique graphs
โœ Mieczysล‚aw Borowiecki; Ewa Drgas-Burchardt ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 263 KB