O. Bendele

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Sorry, we do not have enough data to show an influence graph for this author.
Learn More
Let G be a connected graph of chromatic number k. For a k-coloring f of G, a full f -rainbow path is a path of order k in G whose vertices are all colored differently by f . We show that G has a k-coloring f such that every vertex of G lies on a full f -rainbow path, which provides a positive answer to a question posed by Lin (Simple proofs of results on(More)
  • 1