𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two

✍ Scribed by Elaine M. Eschen; Chính T. Hoàng; R. Sritharan; Lorna Stewart

Book ID
108114291
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
195 KB
Volume
311
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on the line-distinguishing chroma
A note on the line-distinguishing chromatic number and the chromatic index of a graph
✍ N. Zagaglia Salvi 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB 👁 1 views

## Abstract Let λ(__G__) be the line‐distinguishing chromatic number and __x__′(__G__) the chromatic index of a graph __G__. We prove the relation λ(__G__) ≥ __x__′(__G__), conjectured by Harary and Plantholt. © 1993 John Wiley & Sons, Inc.

The number of bifurcation points of a pe
The number of bifurcation points of a periodic one-parameter ODE with at most two periodic solutions
✍ José L. Bravo; Manuel Fernández; Antonio Tineo 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 295 KB

We study the number of bifurcation points of x = F(t; x; ), where F is periodic in t, continuous, and locally Lipschitz continuous with respect to x, by assuming that the di erential equation has at most two periodic solutions for each ∈ R. Under some additional assumptions we prove that there are a