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):
Displaying 36 items.
- Achromatic number of collections of paths and cycles (Q383738) (← links)
- Bounds for the \(b\)-chromatic number of \(G-v\) (Q385136) (← links)
- Minimum order of graphs with given coloring parameters (Q488290) (← links)
- Restricted coloring problems on graphs with few \(P_4\)'s (Q490171) (← links)
- Acyclic and star colorings of cographs (Q643025) (← links)
- \(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs (Q747619) (← links)
- On algorithms for (\(P_5\), gem)-free graphs (Q817767) (← links)
- The micro-world of cographs (Q831855) (← 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)
- On the achromatic number of signed graphs (Q1711838) (← links)
- On retracts, absolute retracts, and foldings in cographs (Q1749782) (← links)
- Homomorphically full graphs (Q1917297) (← links)
- \(b\)-chromatic number of Cartesian product of some families of graphs (Q2014703) (← links)
- Complete colourings of hypergraphs (Q2279996) (← links)
- On the \(b\)-continuity property of graphs (Q2381540) (← links)
- On the Grundy number of Cameron graphs (Q2413405) (← links)
- Computing and counting longest paths on circular-arc graphs in polynomial time (Q2448873) (← links)
- The harmonious coloring problem is NP-complete for interval and permutation graphs (Q2457020) (← links)
- Efficient approximation algorithms for the achromatic number (Q2503345) (← links)
- Harmonious coloring: parameterized algorithms and upper bounds (Q2632021) (← links)
- Generalising the achromatic number to Zaslavsky's colourings of signed graphs (Q2672623) (← links)
- Complete edge-colored permutation graphs (Q2672966) (← links)
- Restricted coloring problems on graphs with few (Q2840684) (← links)
- Achromatic number of fragmentable graphs (Q3055929) (← links)
- Linear-time algorithm for the matched-domination problem in cographs (Q3101607) (← links)
- Harmonious Coloring: Parameterized Algorithms and Upper Bounds (Q3181062) (← links)
- The Micro-world of Cographs (Q5041177) (← links)
- On the Pseudo-achromatic Number Problem (Q5302045) (← links)
- VLSI layout of Benes networks (Q5446251) (← links)
- Complexity of maximum cut on interval graphs (Q6174803) (← links)
