The pseudoachromatic number of a graph

DOI10.1007/S10012-000-0129-ZzbMATH Open0959.05043OpenAlexW2017278757MaRDI QIDQ1586845

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

chromatic numberachromatic numberpseudoachromatic numberpseudocomplete coloring

Mathematics Subject Classification ID

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

Cited In (10)

• Achromatic numbers for circulant graphs and digraphs
• Complete colorings of planar graphs
• Graph colourings and partitions
• Geometric achromatic and pseudoachromatic indices
• On the pseudo-achromatic number problem
• Achromatic colorings of polarity graphs
• Title not available (Why is that?)
• On the Pseudo-achromatic Number Problem
• On pseudoachromatic number of graphs
• Neighborhood pseudo achromatic number of a complete \(p\)-partite graph

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On the pseudoachromatic index of the complete graph 👍 👎
• The total chromatic number of pseudo-Halin graphs with lower degree 👍 👎
• The total chromatic number of pseudo-outerplanar graphs 👍 👎
• The strong pseudoachromatic number of a graph 👍 👎
• On the pseudoachromatic number of join of graphs 👍 👎
• On pseudoachromatic number of graphs 👍 👎
• Neighborhood pseudo achromatic number of a complete \(p\)-partite graph 👍 👎

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)