On pseudoachromatic number of graphs
From MaRDI portal
Recommendations
- The pseudoachromatic number of a graph
- On the pseudoachromatic number of join of graphs
- scientific article; zbMATH DE number 1874447
- On the pseudoachromatic index of the complete graph
- On pseudocomplete coloring of graphs
- The strong pseudoachromatic number of a graph
- The total chromatic number of pseudo-outerplanar graphs
- A note on pseudocomplete coloring of graphs
- The total chromatic number of pseudo-Halin graphs with lower degree
- On the pseudoachromatic index of the complete graph. II
Cited in
(15)- On the pseudo-achromatic number problem
- Achromatic number versus pseudoachromatic number: A counterexample to a conjecture of Hedetniemi
- The pseudoachromatic number of a graph
- On the Pfaffian number of graphs
- New upper bounds for the pseudoachromatic and upper irredundance numbers of a graph
- A note on pseudocomplete coloring of graphs
- scientific article; zbMATH DE number 475586 (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 criticality and additivity of the pseudoachromatic number under join
- Structure of the set of generating graphs in the theory of pseudocriteria
This page was built for publication: On pseudoachromatic number of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q655680)
