scientific article; zbMATH DE number 1057876
From MaRDI portal
Publication:4352945
zbMath0882.05062MaRDI QIDQ4352945
Publication date: 2 March 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Coloring of graphs and hypergraphs (05C15)
Related Items (24)
Packing analogue of \(k\)-radius sequences ⋮ Harmonious coloring: parameterized algorithms and upper bounds ⋮ Harmonious Coloring: Parameterized Algorithms and Upper Bounds ⋮ Achromatic number of collections of paths and cycles ⋮ Complete acyclic colorings ⋮ Complete oriented colourings and the oriented achromatic number ⋮ Harmonious and achromatic colorings of fragmentable hypergraphs ⋮ The harmonious coloring problem is NP-complete for interval and permutation graphs ⋮ Complete partitions of graphs ⋮ On the complexity of generalized chromatic polynomials ⋮ Harmonious and achromatic colorings of fragmentable hypergraphs ⋮ Connection Matrices for MSOL-Definable Structural Invariants ⋮ Upward three-dimensional grid drawings of graphs ⋮ Complete colourings of hypergraphs ⋮ NP-completeness results for some problems on subclasses of bipartite and chordal graphs ⋮ Achromatic Number of K 5 × K n for Small n ⋮ Achromatic number and facial achromatic number of connected locally-connected graphs ⋮ Fine-grained complexity of rainbow coloring and its variants ⋮ Generalization of Achromatic Colouring of Central Graphs ⋮ Fine-Grained Complexity of Rainbow Coloring and its Variants. ⋮ The achromatic number of bounded degree trees ⋮ The harmonious chromatic number of complete \(r\)-ary trees ⋮ On the achromatic number of hypercubes ⋮ Some colouring problems for Paley graphs
This page was built for publication:
