Cite
HARVARD Citation
Lau Lau, G. et al. (2011). Chromatic Classes of 2-Connected (n, n+4)-Graphs with Exactly Three Triangles and at Least Two Induced 4-Cycles. ISRN discrete mathematics. p. . [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Lau Lau, G. et al. (2011). Chromatic Classes of 2-Connected (n, n+4)-Graphs with Exactly Three Triangles and at Least Two Induced 4-Cycles. ISRN discrete mathematics. p. . [Online].