The pseudoachromatic number of a graph

DOI10.1007/S10012-000-0129-ZMaRDI QIDQ1586845zbMATH OpenOpenAlexFDO

Authors V. Yegnanarayanan

Publication date 19 March 2001

Published in Southeast Asian Bulletin of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10012-000-0129-z

zbMATH Keywords

achromatic numberchromatic numberpseudoachromatic numberpseudocomplete coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

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.

Recommendations

• On pseudoachromatic number of graphs
• The strong pseudoachromatic number of a graph
• scientific article; zbMATH DE number 6468154
• On the pseudoachromatic index of the complete graph
• On the pseudoachromatic number of join of graphs
• scientific article; zbMATH DE number 1874447
• The total chromatic number of pseudo-outerplanar graphs
• The total chromatic number of pseudo-Halin graphs with lower degree
• On pseudocomplete coloring of graphs
• Neighborhood pseudo achromatic number of a complete p-partite graph

Cited in

(18)

• On the pseudo-achromatic number problem
• Achromatic number versus pseudoachromatic number: A counterexample to a conjecture of Hedetniemi
• Complete colorings of planar graphs
• Achromatic numbers for circulant graphs and digraphs
• The strong pseudoachromatic number of a graph
• New upper bounds for the pseudoachromatic and upper irredundance numbers of a graph
• Geometric achromatic and pseudoachromatic indices
• A note on pseudocomplete coloring of graphs
• scientific article; zbMATH DE number 4010539 (Why is no real title available?)
• On the pseudoachromatic number of join of graphs
• scientific article; zbMATH DE number 1874447 (Why is no real title available?)
• On the Pseudo-achromatic Number Problem
• scientific article; zbMATH DE number 6468154 (Why is no real title available?)
• Graph colourings and partitions
• Neighborhood pseudo achromatic number of a complete p-partite graph
• On pseudoachromatic number of graphs
• Achromatic colorings of polarity graphs
• On criticality and additivity of the pseudoachromatic number under join

This page was built for publication: The pseudoachromatic number of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1586845)