𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A necessary and sufficient condition for acyclic graphs

✍ Scribed by Ravi, R.

Book ID
119814435
Publisher
IEEE
Year
1985
Tongue
English
Weight
175 KB
Volume
73
Category
Article
ISSN
0018-9219

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Necessary and sufficient conditions for
Necessary and sufficient conditions for R-graph synthesis
✍ David P. Brown; Myril B. Reed πŸ“‚ Article πŸ“… 1962 πŸ› Elsevier Science 🌐 English βš– 448 KB

It is shown that any symmetric matrix can be considered as the short circuit admittance matrix of a graph consisting of the union of a complete graph and arbitrary tree form. The necessary and sufficient conditions that a real matrix of order v-1 be the short circuit admittance matrix of a v-vertex

A necessary and sufficient condition for
A necessary and sufficient condition for the star decomposition of complete graphs
✍ Lin, Chiang; Shyu, Tay-Woei πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 130 KB πŸ‘ 2 views

In this paper w e prove the following result. Let ml 2 m2 2 ... 2 ml be nonnegative integers. A necessary and sufficient condition for the complete graph K,, to be decomposed into stars S,,, , S

Sufficient and Necessary Condition
Sufficient and Necessary Condition
✍ Clarence H. Heinke πŸ“‚ Article πŸ“… 1965 πŸ› School Science and Mathematics Association 🌐 English βš– 345 KB
A sufficient condition for planar graphs
A sufficient condition for planar graphs to be acyclically 5-choosable
✍ Min Chen; AndrΓ© Raspaud πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 216 KB πŸ‘ 1 views

## Abstract A proper vertex coloring of a graph __G__ = (__V, E__) is acyclic if __G__ contains no bicolored cycle. Given a list assignment __L__ = {__L__(__v__)|__v__∈__V__} of __G__, we say __G__ is acyclically __L__‐list colorable if there exists a proper acyclic coloring Ο€ of __G__ such that Ο€(