Article
Extremal graphs in some coloring problems.
Department of Mathematics, Annamalai University, Annamalainagar 608 002, India
Discrete Mathematics
(Impact Factor: 0.57).
05/1998;
186:1524.
DOI: 10.1016/S0012365X(97)002161
Source: DBLP


Article: On pseudoachromatic number of graphs
[Show abstract] [Hide abstract]
ABSTRACT: The pseudoachromatic number of a graph G is the maximum size of a vertex partition of G (where the sets of the partition may or may not be independent) such that there is at least one edge of G between any two distinct parts. In this paper, the pseudoachromatic number is determined for some graphs.Southeast Asian Bulletin of Mathematics 05/2011; 35:431438. 
[Show abstract] [Hide abstract]
ABSTRACT: The pseudoachromatic number of a graph G is the maximum size of a vertex partition of G (where the sets of the partition may or may not be independent) such that, between any two distinct parts, there is at least one edge of G. This parameter is determined for graphs such as cycles, paths, wheels, certain complete multipartite graphs, and for other classes of graphs. Some open problems are raised.Southeast Asian Bulletin of Mathematics 02/2000; 24(1):129136. DOI:10.1007/s100120000129z
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed.
The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual
current impact factor.
Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence
agreement may be applicable.