Pages that link to "Item:Q3331240"
From MaRDI portal
The following pages link to On the Harmonious Coloring of Graphs (Q3331240):
Displaying 21 items.
- Super total graceful graphs (Q324988) (← links)
- Harmonious coloring of trees with large maximum degree (Q418860) (← links)
- Harmonious colourings of graphs (Q516809) (← links)
- On the complexity of generalized chromatic polynomials (Q679542) (← links)
- The harmonious chromatic number of a complete binary and trinary tree (Q685580) (← links)
- NP-completeness results for some problems on subclasses of bipartite and chordal graphs (Q995581) (← links)
- Set colorings of graphs (Q1024295) (← links)
- The harmonious coloring number of a graph (Q1182896) (← links)
- The complexity of harmonious colouring for trees (Q1346692) (← links)
- The exact value of the harmonious chromatic number of a complete binary tree (Q1366782) (← links)
- On the harmonious chromatic number of a graph (Q1823253) (← links)
- Coloring a dominating set without conflicts: \(q\)-subset square coloring (Q2097209) (← links)
- Harmonious coloring: parameterized algorithms and upper bounds (Q2632021) (← links)
- Harmonious Coloring: Parameterized Algorithms and Upper Bounds (Q3181062) (← links)
- Uniform Algebraic Reducibilities between Parameterized Numeric Graph Invariants (Q3507454) (← links)
- Connection Matrices for MSOL-Definable Structural Invariants (Q3601800) (← links)
- Central Graph of Quadrilateral Snakes with Chromatic Number (Q5009123) (← links)
- RECURSIVE AXIOMATISATIONS FROM SEPARATION PROPERTIES (Q5015731) (← links)
- The edge-distinguishing chromatic number of petal graphs, chorded cycles, and spider graphs (Q5054038) (← links)
- Colouring a dominating set without conflicts: \(q\)-subset square colouring (Q6077071) (← links)
- An \(iP_2\) extended star graph and its harmonious chromatic number (Q6498094) (← links)
