✦ LIBER ✦

A new method for proving chromatic uniqueness of graphs

✍ Scribed by Ru-Ying Liu; Lian-Chang Zhao

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 359 KB
Volume: 171
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(96)00078-7

No coin nor oath required. For personal study only.

✦ Synopsis

We give a brief survey on a new method for proving the chromatic uniqueness of graphs by their adjoint polynomials. We obtain some simpler proofs of relevant theorems and a new family of chromatically unique graphs.

📜 SIMILAR VOLUMES

A new method of proving theorems on chro

A new method of proving theorems on chromatic index

✍ A. Ehrenfeucht; V. Faber; H.A. Kierstead 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 690 KB

## V.G. Wing proved that the edge-chromatic 11umber x' of any multigraph M with m&mum degree A(M) aud maximum multiplicity p(M) is A(M)+pLM). In this paper we present a new method for proving this and other related results that are due to Gol'dberg, Anderson, Ore, Shannon, and Vizing. In our proof

A note on chromatic uniqueness of graphs

✍ G. L. Chia 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB

New method for proving uniqueness theore

New method for proving uniqueness theorems for obstacle inverse scattering problems

✍ A.G. Ramm 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 197 KB

On σ-polynomials and a class of chromati

On σ-polynomials and a class of chromatically unique graphs

✍ 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

A method for proving uniqueness theorems

A method for proving uniqueness theorems for the stationary semiconductor device and electrochemistry equations

✍ Fatha Alabau 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 730 KB

New bounds for the chromatic number of g

New bounds for the chromatic number of graphs

✍ Manouchehr Zaker 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 184 KB 👁 1 views

## Abstract In this article we first give an upper bound for the chromatic number of a graph in terms of its degrees. This bound generalizes and modifies the bound given in 11. Next, we obtain an upper bound of the order of magnitude ${\cal O}({n}^{{1}-\epsilon})$ for the coloring number of a graph