Pages that link to "Item:Q1883661"
From MaRDI portal
The following pages link to Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard (Q1883661):
Displaying 31 items.
- List monopolar partitions of claw-free graphs (Q442362) (← links)
- The complexity of partitioning into disjoint cliques and a triangle-free graph (Q516874) (← links)
- A polynomial Turing-kernel for weighted independent set in bull-free graphs (Q521799) (← links)
- On the complexity of generalized chromatic polynomials (Q679542) (← links)
- Algorithms for unipolar and generalized split graphs (Q741738) (← links)
- Solving partition problems with colour-bipartitions (Q742575) (← links)
- On invariants of hereditary graph properties (Q868369) (← links)
- Polarity of chordal graphs (Q955313) (← links)
- On \(P_4\)-transversals of chordal graphs (Q998435) (← links)
- Trees, paths, stars, caterpillars and spiders (Q1635718) (← links)
- Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs (Q1678166) (← links)
- Co-bipartite neighborhood edge elimination orderings (Q1689989) (← links)
- Some problems on induced subgraphs (Q1693168) (← links)
- Minimal obstructions to \(( \infty , k )\)-polarity in cographs (Q2032730) (← links)
- Vertex partitioning problems on graphs with bounded tree width (Q2161252) (← links)
- Minimal obstructions to \(( s , 1 )\)-polarity in cographs (Q2184672) (← links)
- Partitioning a graph into disjoint cliques and a triangle-free graph (Q2352776) (← links)
- Minimal obstructions to 2-polar cographs (Q2414467) (← links)
- Complexity and algorithms for recognizing polar and monopolar graphs (Q2437850) (← links)
- Monopolar graphs: complexity of computing classical graph parameters (Q2659081) (← links)
- Generalized Coloring of Permutations (Q5009614) (← links)
- (Q5009615) (← links)
- Harary polynomials (Q5056203) (← links)
- Inductive graph invariants and approximation algorithms (Q5101914) (← links)
- Solving Partition Problems Almost Always Requires Pushing Many Vertices Around (Q5220192) (← links)
- On the Polarity and Monopolarity of Graphs (Q5418774) (← links)
- Unique Factorization Theorem and Formal Concept Analysis (Q5452428) (← links)
- The Complexity of Drawing Graphs on Few Lines and Few Planes (Q6075709) (← links)
- Minimization and parameterized variants of vertex partition problems on graphs (Q6087212) (← links)
- Generalized coloring of permutations (Q6582372) (← links)
- Complexity of near-3-choosability problem (Q6632143) (← links)
