1. IR @ Alliance University
  2. Journal Articles Archive
  3. Articles to be qced
Please use this identifier to cite or link to this item: https://gnanaganga.inflibnet.ac.in:8443/jspui/handle/123456789/7644
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBruce L. Bauslaugh-
dc.contributor.authorGary Macgillivray-
dc.date.accessioned2024-02-27T06:20:42Z-
dc.date.available2024-02-27T06:20:42Z-
dc.date.issued2005-
dc.identifier.urihttp://gnanaganga.inflibnet.ac.in:8080/jspui/handle/123456789/7644-
dc.description.abstractWe give a polynomial-time algorithm for determining whether a doubly-periodic infinite graph is 2-colourable. This is a consequence of an upper bound established on the length of a shortest odd cycle.-
dc.publisherBulletin of the Institute of Combinatorics and Its Applications-
dc.title2-Colouring Doubly-Periodic Graphs-
dc.volVol 45-
Appears in Collections:Articles to be qced

Files in This Item:
File SizeFormat 
2-Colouring Doubly-Periodic Graphs.pdf2.04 MBAdobe PDFView/Open
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.