Proof of Toft s Conjecture: Every Graph Containing No Fully Odd K4 is 3-Colorable - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Wenan Zang. Proof of Toft s Conjecture: Every Graph Containing No Fully Odd K4 is 3-Colorable. J. Comb. Optim., 2(2):117-188, 1998.

@article{Zang98:1,
  title = {Proof of Toft s Conjecture: Every Graph Containing No Fully Odd K4 is 3-Colorable},
  author = {Wenan Zang},
  year = {1998},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Zang98%3A1},
  cites = {0},
  citedby = {0},
  journal = {J. Comb. Optim.},
  volume = {2},
  number = {2},
  pages = {117-188},
}

runs on WebDSL