Edge-colorings of graphs avoiding complete graphs with a prescribed coloring. Benevides, F., Hoppen, C., & Sampaio, R. M. Discret. Math., 340(9):2143–2160, 2017.
Edge-colorings of graphs avoiding complete graphs with a prescribed coloring [link]Paper  doi  bibtex   
@article{DBLP:journals/dm/BenevidesHS17,
  author    = {Fabr{\'{\i}}cio Benevides and
               Carlos Hoppen and
               Rudini M. Sampaio},
  title     = {Edge-colorings of graphs avoiding complete graphs with a prescribed
               coloring},
  journal   = {Discret. Math.},
  volume    = {340},
  number    = {9},
  pages     = {2143--2160},
  year      = {2017},
  url       = {https://doi.org/10.1016/j.disc.2017.04.011},
  doi       = {10.1016/j.disc.2017.04.011},
  timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/dm/BenevidesHS17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0