𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Complete Solution to a Conjecture on theβ-Polynomials of Graphs

✍ Scribed by Xueliang Li; Haixing Zhao; Lusheng Wang

Book ID
111544618
Publisher
Springer
Year
2003
Tongue
English
Weight
103 KB
Volume
33
Category
Article
ISSN
0259-9791

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a conjecture of Gallai concerning com
On a conjecture of Gallai concerning complete subgraphs of k-critical graphs
✍ H.L. Abbott; B. Zhou 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 418 KB

Abbott, H.L. and B. Zhou, On a conjecture of Gallai concerning complete subgraphs of k-critical graphs, Discrete Mathematics 100 (1992) 223-228. A graph G is said to be k-critical if it has chromatic number k but every proper subgraph of G has a (k -l)-coloring. T. Gallai asked whether each k-criti

A solution to Gutman's problem on the ch
A solution to Gutman's problem on the characteristic polynomial of a bipartite graph
✍ Xueliang Li; Heping Zhang 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 209 KB

In this short paper, we present a solution to Gutman's problem on the characteristic polynomial of a bipartite graph (Research Problem 134, Discrete Math. 88 (1991)). In [2] I. Gutman proposed a research problem which is stated as follows. The matchings polynomial of a graph G is defined by cl(G,x)