Note making a ::::K:::: ::4::-free graph bipartite

Benny Sudakov. Note making a ::::K:::: ::4::-free graph bipartite. Combinatorica, 27(4):509-518, 2007. [doi]

@article{Sudakov07-0,
  title = {Note making a ::::K:::: ::4::-free graph bipartite},
  author = {Benny Sudakov},
  year = {2007},
  url = {http://springerlink.metapress.com/content/w8616230k821r708/},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Sudakov07-0},
  cites = {0},
  citedby = {0},
  journal = {Combinatorica},
  volume = {27},
  number = {4},
  pages = {509-518},
}