A proper coloring of the vertices of a graph is called a star coloring if every two color classes induce a star forest. Star colorings are a strengthening of acyclic colorings, i.e., proper coloringsâ€¦ (More)

An Eulerian subgraph in a digraph is a subgraph in which indegree equals outdegree at each vertex. Alon and Tarsi [2] proved that a graph is d-choosable when it has an orientation that has no vertexâ€¦ (More)

End-to-end communication considers the problem of sending messages from a sender s to a receiver r through an asynchronous, unreliable network, such as the Internet. We consider the problem ofâ€¦ (More)

The notion of a split coloring of a complete graph was introduced by ErdÅ‘s and GyÃ¡rfÃ¡s [7] as a generalization of split graphs. In this paper, we offer an alternate interpretation by comparing such aâ€¦ (More)