The pseudoachromatic number of a graph
type: Item
instance of: scholarly article
title: The pseudoachromatic number of a graph
zbMATH Open document ID: 0959.05043
author: V. Yegnanarayanan
published in: Southeast Asian Bulletin of Mathematics
publication date: 2001-03-19T00:00:00Z
review text: 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\). In this paper this new parameter is determined for cycles, paths, wheels and certain complete multipartite graphs. Some open problems are raised.
reviewed by: Ioan Tomescu
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 1533402
zbMATH Keywords: pseudoachromatic number
zbMATH Keywords: achromatic number
zbMATH Keywords: chromatic number
zbMATH Keywords: pseudocomplete coloring
MaRDI profile type: Publication
full work available at URL: s10012-000-0129-z
OpenAlex ID: W2017278757
DOI: 10.1007/S10012-000-0129-Z
Recommended article: On pseudoachromatic number of graphs
Recommended article: The strong pseudoachromatic number of a graph
Recommended article: Q5499541
Recommended article: On the pseudoachromatic index of the complete graph
Recommended article: On the pseudoachromatic number of join of graphs
Recommended article: Q4795898
Recommended article: The total chromatic number of pseudo-outerplanar graphs
Recommended article: The total chromatic number of pseudo-Halin graphs with lower degree
Recommended article: Q5500114
Recommended article: Neighborhood pseudo achromatic number of a complete \(p\)-partite graph
description: scientific article; zbMATH DE number 1533402