@InProceedings{vikas:LIPIcs.MFCS.2017.69,
  author =	{Vikas, Narayan},
  title =	{{Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive Hexagon}},
  booktitle =	{42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
  pages =	{69:1--69:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-046-0},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{83},
  editor =	{Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.69},
  URN =		{urn:nbn:de:0030-drops-81374},
  doi =		{10.4230/LIPIcs.MFCS.2017.69},
  annote =	{Keywords: computational complexity, algorithms, graph, partition, colouring, homomorphism, retraction, compaction, vertex-compaction}
}