✦ LIBER ✦

A note on a matrix criterion for unique colorability of a signed graph

✍ Scribed by Terry C. Gleason; Dorwin Cartwright

Book ID: 112725406
Publisher: Springer
Year: 1967
Tongue: English
Weight: 401 KB
Volume: 32
Category: Article
ISSN: 0033-3123
DOI: 10.1007/bf02289592

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Search for a unique incidence matrix of

Search for a unique incidence matrix of a graph

✍ Andrzej Proskurowski 📂 Article 📅 1974 🏛 Springer Netherlands 🌐 English ⚖ 958 KB

Note on a graph-theoretic criterion for

Note on a graph-theoretic criterion for structural output controllability

✍ Murota, K.; Poljak, S. 📂 Article 📅 1990 🏛 IEEE 🌐 English ⚖ 451 KB

A note on chromatic uniqueness of graphs

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

A note on the lower bounds of signed dom

A note on the lower bounds of signed domination number of a graph

✍ Zhongfu Zhang; Baogen Xu; Yinzhen Li; Linzhong Liu 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 159 KB

On a conjecture about uniquely colorable

On a conjecture about uniquely colorable perfect graphs

✍ Gábor Bacsó 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 894 KB

A Note on Graph Colorings and Graph Poly

A Note on Graph Colorings and Graph Polynomials

✍ Noga Alon; Michael Tarsi 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 230 KB

## dedicated to professor w. t. tutte on the occasion of his eightieth birtday It is known that the chromatic number of a graph G=(V, E) with V= [1, 2, ..., n] exceeds k iff the graph polynomial f G => ij # E, i<j (x i &x j ) lies in certain ideals. We describe a short proof of this result, using