Pages that link to "Item:Q1825646"
From MaRDI portal
The following pages link to Achromatic number is NP-complete for cographs and interval graphs (Q1825646):
Displayed 14 items.
- On algorithms for (\(P_5\), gem)-free graphs (Q817767) (← links)
- MSOL partitioning problems on graphs of bounded treewidth and clique-width (Q884481) (← 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)
- On the b-coloring of cographs and \(P_{4}\)-sparse graphs (Q1043801) (← links)
- Paths in interval graphs and circular arc graphs (Q1210553) (← links)
- The b-chromatic number of a graph (Q1283791) (← links)
- Homomorphically full graphs (Q1917297) (← links)
- On the \(b\)-continuity property of graphs (Q2381540) (← links)
- The harmonious coloring problem is NP-complete for interval and permutation graphs (Q2457020) (← links)
- Efficient approximation algorithms for the achromatic number (Q2503345) (← links)
- On the Pseudo-achromatic Number Problem (Q5302045) (← links)
- VLSI layout of Benes networks (Q5446251) (← links)