Pages that link to "Item:Q1586845"
From MaRDI portal
The following pages link to The pseudoachromatic number of a graph (Q1586845):
Displaying 13 items.
- Geometric achromatic and pseudoachromatic indices (Q292239) (← links)
- On pseudoachromatic number of graphs (Q655680) (← links)
- On the pseudo-achromatic number problem (Q1006054) (← links)
- Achromatic number versus pseudoachromatic number: A counterexample to a conjecture of Hedetniemi (Q1567683) (← links)
- Complete colorings of planar graphs (Q1727729) (← links)
- Achromatic numbers for circulant graphs and digraphs (Q2656326) (← links)
- The strong pseudoachromatic number of a graph (Q2811807) (← links)
- New upper bounds for the pseudoachromatic and upper irredundance numbers of a graph (Q2878210) (← links)
- On the Pseudo-achromatic Number Problem (Q5302045) (← links)
- (Q5499541) (← links)
- Graph colourings and partitions (Q5941502) (← links)
- Neighborhood pseudo achromatic number of a complete \(p\)-partite graph (Q6142580) (← links)
- Achromatic colorings of polarity graphs (Q6615554) (← links)