The achromatic number of a graph

From MaRDI portal
Publication:5591379

DOI10.1016/S0021-9800(70)80072-2zbMath0195.25702OpenAlexW2083271579MaRDI QIDQ5591379

Stephen T. Hedetniemi, Frank Harary

Publication date: 1970

Published in: Journal of Combinatorial Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0021-9800(70)80072-2




Related Items (36)

On the \(b\)-continuity property of graphsUnnamed ItemOn upper bounds for the pseudo-achromatic indexBounds for the \(b\)-chromatic number of \(G-v\)Generalising the achromatic number to Zaslavsky's colourings of signed graphsComplete oriented colourings and the oriented achromatic numberBounding the pseudoachromatic index of the complete graph via projective planesOn the equality of the partial Grundy and upper ochromatic numbers of graphsOn the achromatic number of signed graphsOn the \(b\)-domatic number of graphsDecomposition of a complete graph into trails of given lengthsExtremal regular graphs for the achromatic numberColor chain of a graphThe harmonious coloring problem is NP-complete for interval and permutation graphsMore bounds for the Grundy number of graphsOn retracts, absolute retracts, and foldings in cographsA survey on the Intersection graphs of ideals of ringsOn the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering ProblemGraph colourings and partitions\(b\)-chromatic number of Cartesian product of some families of graphsExact values for theb-chromatic number of a power completek-ary treePartition graphs and coloring numbers of a graphEfficient approximation algorithms for the achromatic numberFacial achromatic number of triangulations on the sphereNP-completeness results for some problems on subclasses of bipartite and chordal graphsGraph theoryAchromatic number and facial achromatic number of connected locally-connected graphsOn the pseudoachromatic index of the complete graph\(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographsOn \(b\)-colorings in regular graphsThe subchromatic number of a graphThe b-chromatic number of a graphGeneralization of Achromatic Colouring of Central GraphsAn interpolation theorem for partitions which are complete with respect to hereditary propertiesExtremal graphs in some coloring problemsOn the achromatic number of hypercubes




This page was built for publication: The achromatic number of a graph