Pages that link to "Item:Q1346692"
From MaRDI portal
The following pages link to The complexity of harmonious colouring for trees (Q1346692):
Displayed 15 items.
- Harmonious coloring of trees with large maximum degree (Q418860) (← links)
- Complete partitions of graphs (Q949754) (← links)
- NP-completeness results for some problems on subclasses of bipartite and chordal graphs (Q995581) (← links)
- On the pseudo-achromatic number problem (Q1006054) (← links)
- The harmonious chromatic number of complete \(r\)-ary trees (Q1301657) (← links)
- The achromatic number of bounded degree trees (Q1584329) (← links)
- Colored homomorphisms of colored mixed graphs (Q1850491) (← links)
- Connection Matrices for MSOL-Definable Structural Invariants (Q3601800) (← links)
- Counting Unlabelled Subtrees of a Tree is #P-complete (Q4504966) (← links)
- The Harmonious Chromatic Number of Bounded Degree Trees (Q4883059) (← links)
- On the Pseudo-achromatic Number Problem (Q5302045) (← links)
- Evaluations of Graph Polynomials (Q5302054) (← links)
- VLSI layout of Benes networks (Q5446251) (← links)
- Homomorphisms of 2-edge-colored graphs (Q5900082) (← links)
- Homomorphisms of 2-edge-colored graphs (Q5901070) (← links)