Please use this identifier to cite or link to this item: https://gnanaganga.inflibnet.ac.in:8443/jspui/handle/123456789/7644
Title: 2-Colouring Doubly-Periodic Graphs
Authors: Bruce L. Bauslaugh
Gary Macgillivray
Issue Date: 2005
Publisher: Bulletin of the Institute of Combinatorics and Its Applications
Abstract: We 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.
URI: http://gnanaganga.inflibnet.ac.in:8080/jspui/handle/123456789/7644
Appears in Collections:Articles to be qced

Files in This Item:
File SizeFormat 
2-Colouring Doubly-Periodic Graphs.pdf
  Restricted Access
2.04 MBAdobe PDFView/Open Request a copy


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