• Journal of Graph Theory
• 1997
A graph is (k, d)-colorable if one can color the vertices with k colors such that no vertex is adjacent to more than d vertices of its same color. In this paper we investigate the existence of suchâ€¦ (More)
A function Ï€ : V â†’ {1, . . . , k} is a broadcast coloring of order k if Ï€(u) = Ï€(v) implies that the distance between u and v is more than Ï€(u). The minimum order of a broadcast coloring is calledâ€¦ (More)
• SODA
• 1997
An (ordinary vertex) coloring is a partition of the vertices of a graph into independent sets. The chromatic number is the minimum number of colors needed to produce such a partition. This paperâ€¦ (More)
• Discrete Mathematics
• 1994
A graph G is said to be packable by the graph F if its edges can be partitioned into copies of F. It is called randomly packable if what remains after deletion of the edges of a proper subgraph thatâ€¦ (More)
• Discrete Applied Mathematics
• 1992
Bagga, K.S., L.W. Beineke, W.D. Goddard, M.J. Discrete Applied Mathematics 37138 (1992) 13-28. Lipman and R.E. Pippert, A survey of integrity, A communication network can be considered to be highlyâ€¦ (More)
A set S is an offensive alliance if for every vertex v in its boundary N(S)âˆ’S it holds that the majority of vertices in vâ€™s closed neighbourhood are in S. The offensive alliance number is the minimumâ€¦ (More)