scientific article; zbMATH DE number 1057876
From MaRDI portal
Publication:4352945
Recommendations
Cited in
(30)- Complete acyclic colorings
- Fine-grained complexity of rainbow coloring and its variants
- Fine-Grained Complexity of Rainbow Coloring and its Variants.
- The growth rate of the harmonious chromatic number
- On the harmonious chromatic number of graphs
- NP-completeness results for some problems on subclasses of bipartite and chordal graphs
- Achromatic number and facial achromatic number of connected locally-connected graphs
- The achromatic number of bounded degree trees
- Some colouring problems for Paley graphs
- Harmonious and achromatic colorings of fragmentable hypergraphs
- Harmonious coloring: parameterized algorithms and upper bounds
- Upward three-dimensional grid drawings of graphs
- Complete colourings of hypergraphs
- Connection Matrices for MSOL-Definable Structural Invariants
- Complete oriented colourings and the oriented achromatic number
- On the complexity of generalized chromatic polynomials
- The achromatic number of the union of cycles
- Achromatic Number of K 5 × K n for Small n
- On harmonious coloring of hypergraphs
- Achromatic number of collections of paths and cycles
- scientific article; zbMATH DE number 2104720 (Why is no real title available?)
- Harmonious coloring: parameterized algorithms and upper bounds
- Complete partitions of graphs
- Harmonious and achromatic colorings of fragmentable hypergraphs
- The harmonious coloring problem is NP-complete for interval and permutation graphs
- Generalization of achromatic colouring of central graphs
- On the achromatic number of hypercubes
- Packing analogue of \(k\)-radius sequences
- The harmonious chromatic number of complete \(r\)-ary trees
- Achromonious graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4352945)
