Pages that link to "Item:Q2457020"
From MaRDI portal
The following pages link to The harmonious coloring problem is NP-complete for interval and permutation graphs (Q2457020):
Displayed 9 items.
- Restricted coloring problems on graphs with few \(P_4\)'s (Q490171) (← links)
- Harmonious colourings of graphs (Q516809) (← links)
- NP-completeness results for some problems on subclasses of bipartite and chordal graphs (Q995581) (← links)
- Square-root Kalman filtering of descriptor systems (Q1199857) (← links)
- Distributed interactive proofs for the recognition of some geometric intersection graph classes (Q2097349) (← links)
- Harmonious coloring: parameterized algorithms and upper bounds (Q2632021) (← links)
- Restricted coloring problems on graphs with few (Q2840684) (← links)
- Harmonious Coloring: Parameterized Algorithms and Upper Bounds (Q3181062) (← links)
- Complexity of maximum cut on interval graphs (Q6174803) (← links)