The pseudoachromatic number of a graph
From MaRDI portal
Publication:1586845
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
(16)- On the pseudo-achromatic number problem
- The strong pseudoachromatic number of a graph
- On the Pseudo-achromatic Number Problem
- Geometric achromatic and pseudoachromatic indices
- A note on pseudocomplete coloring of graphs
- Neighborhood pseudo achromatic number of a complete \(p\)-partite graph
- On the pseudoachromatic number of join of graphs
- Complete colorings of planar graphs
- Achromatic colorings of polarity graphs
- scientific article; zbMATH DE number 1874447 (Why is no real title available?)
- scientific article; zbMATH DE number 4010539 (Why is no real title available?)
- Graph colourings and partitions
- Achromatic numbers for circulant graphs and digraphs
- New upper bounds for the pseudoachromatic and upper irredundance numbers of a graph
- On pseudoachromatic number of graphs
- scientific article; zbMATH DE number 6468154 (Why is no real title available?)
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)