## Abstract ChemInform is a weekly Abstracting Service, delivering concise information at a glance that was extracted from about 100 leading journals. To access a ChemInform Abstract of an article which was published elsewhere, please select a βFull Textβ option. The original article is trackable v
A Simple Color Reaction for Piperazine*
β Scribed by Barnard, Robert D.
- Publisher
- Elsevier
- Year
- 1947
- Weight
- 97 KB
- Volume
- 36
- Category
- Article
- ISSN
- 0095-9553
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We prove that the game coloring number, and therefore the game chromatic number, of a planar graph is at most 18. This is a slight improvement of the current upper bound of 19. Perhaps more importantly, we bound the game coloring number of a graph G in terms of a new parameter r(G). We use this resu
In this paper we consider the problem of determining whether a given colored graph can be triangulated, such that no edges between vertices of the same color are added. This problem originated from the perfect phylogeny problem from molecular biology and is strongly related with the problem of recog