scientific article; zbMATH DE number 1088659

DOI<129::AID-JGT3>3.0.CO;2-T 10.1002/(SICI)1097-0118(199711)26:3<129::AID-JGT3>3.0.CO;2-TzbMath0884.05043MaRDI QIDQ4364806

Keith J. Edwards, Niall Cairnie

Publication date: 18 March 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

treeNP-hardachromatic number

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15)

Related Items (20)

Geometric achromatic and pseudoachromatic indices ⋮ Achromatic numbers for circulant graphs and digraphs ⋮ Achromatic number of collections of paths and cycles ⋮ Full friendly index set. I ⋮ Complete oriented colourings and the oriented achromatic number ⋮ Achromatic and Harmonious Colorings of Circulant Graphs ⋮ Harmonious and achromatic colorings of fragmentable hypergraphs ⋮ The harmonious coloring problem is NP-complete for interval and permutation graphs ⋮ Minimum order of graphs with given coloring parameters ⋮ Complete partitions of graphs ⋮ Harmonious and achromatic colorings of fragmentable hypergraphs ⋮ A survey on the Intersection graphs of ideals of rings ⋮ Achromatic number of fragmentable graphs ⋮ Efficient approximation algorithms for the achromatic number ⋮ The diachromatic number of digraphs ⋮ Complete colourings of hypergraphs ⋮ NP-completeness results for some problems on subclasses of bipartite and chordal graphs ⋮ The b-chromatic number of a graph ⋮ The achromatic number of bounded degree trees ⋮ On the achromatic number of hypercubes

This page was built for publication: