hrcak mascot   Srce   HID

Izvorni znanstveni članak

Topological Chirality of Minimally Colored Kuratowski Graphs

Chengzhi Liang ; Department of Chemistry, Princeton University, Princeton, NJ 08544, USA
Kurt Mislow ; Department of Chemistry, Princeton University, Princeton, NJ 08544, USA

Puni tekst: engleski, pdf (11 MB) str. 735-744 preuzimanja: 178* citiraj
APA 6th Edition
Liang, C. i Mislow, K. (1997). Topological Chirality of Minimally Colored Kuratowski Graphs. Croatica Chemica Acta, 70 (3), 735-744. Preuzeto s https://hrcak.srce.hr/135642
MLA 8th Edition
Liang, Chengzhi i Kurt Mislow. "Topological Chirality of Minimally Colored Kuratowski Graphs." Croatica Chemica Acta, vol. 70, br. 3, 1997, str. 735-744. https://hrcak.srce.hr/135642. Citirano 21.04.2021.
Chicago 17th Edition
Liang, Chengzhi i Kurt Mislow. "Topological Chirality of Minimally Colored Kuratowski Graphs." Croatica Chemica Acta 70, br. 3 (1997): 735-744. https://hrcak.srce.hr/135642
Harvard
Liang, C., i Mislow, K. (1997). 'Topological Chirality of Minimally Colored Kuratowski Graphs', Croatica Chemica Acta, 70(3), str. 735-744. Preuzeto s: https://hrcak.srce.hr/135642 (Datum pristupa: 21.04.2021.)
Vancouver
Liang C, Mislow K. Topological Chirality of Minimally Colored Kuratowski Graphs. Croatica Chemica Acta [Internet]. 1997 [pristupljeno 21.04.2021.];70(3):735-744. Dostupno na: https://hrcak.srce.hr/135642
IEEE
C. Liang i K. Mislow, "Topological Chirality of Minimally Colored Kuratowski Graphs", Croatica Chemica Acta, vol.70, br. 3, str. 735-744, 1997. [Online]. Dostupno na: https://hrcak.srce.hr/135642. [Citirano: 21.04.2021.]

Sažetak
We prove that topological chirality in a K3 3 graph requires a minimum of two non-adjacent colored edges, while topological chirality in a K5 graph requires a minimum of three colored edges that form an open path.

Hrčak ID: 135642

URI
https://hrcak.srce.hr/135642

Posjeta: 277 *