The following pages link to (Q4364806):
Displaying 21 items.
- Geometric achromatic and pseudoachromatic indices (Q292239) (← links)
- Achromatic number of collections of paths and cycles (Q383738) (← links)
- Full friendly index set. I (Q385157) (← links)
- Complete oriented colourings and the oriented achromatic number (Q400508) (← links)
- Minimum order of graphs with given coloring parameters (Q488290) (← links)
- Complete partitions of graphs (Q949754) (← links)
- NP-completeness results for some problems on subclasses of bipartite and chordal graphs (Q995581) (← links)
- The b-chromatic number of a graph (Q1283791) (← links)
- The achromatic number of bounded degree trees (Q1584329) (← links)
- The diachromatic number of digraphs (Q1784278) (← links)
- On the achromatic number of hypercubes (Q1850476) (← links)
- Complete colourings of hypergraphs (Q2279996) (← links)
- The harmonious coloring problem is NP-complete for interval and permutation graphs (Q2457020) (← links)
- Efficient approximation algorithms for the achromatic number (Q2503345) (← links)
- Achromatic numbers for circulant graphs and digraphs (Q2656326) (← links)
- Achromatic number of fragmentable graphs (Q3055929) (← links)
- (Q3684142) (← links)
- Achromatic and Harmonious Colorings of Circulant Graphs (Q4604012) (← links)
- Harmonious and achromatic colorings of fragmentable hypergraphs (Q5890910) (← links)
- Harmonious and achromatic colorings of fragmentable hypergraphs (Q5920082) (← links)
- A survey on the Intersection graphs of ideals of rings (Q6101486) (← links)
