Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes (Q5163508): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.09425
@@ Property / arXiv ID: 2004.09425 / rank @@
+Normal rank
@@ Property / cites work @@
+Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs
+Normal rank
@@ Property / cites work @@
+Three-coloring and list three-coloring of graphs without induced paths on seven vertices
+Normal rank
@@ Property / cites work @@
+Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
+Normal rank
@@ Property / cites work @@
+A subexponential-time algorithm for the maximum independent set problem in \(P_t\)-free graphs
+Normal rank
@@ Property / cites work @@
+Bounding the Mim-Width of Hereditary Graph Classes.
+Normal rank
@@ Property / cites work @@
+List \(k\)-colouring \(P_t\)-free graphs: a mim-width perspective
+Normal rank
@@ Property / cites work @@
+Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in <i>H</i>-free graphs
+Normal rank
@@ Property / cites work @@
+The Erdős-Hajnal conjecture for bull-free graphs
@@ Property / cites work: The Erdős-Hajnal conjecture for bull-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Approximately coloring graphs without long induced paths
+Normal rank
@@ Property / cites work @@
+Odd Holes in Bull-Free Graphs
@@ Property / cites work: Odd Holes in Bull-Free Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Four-coloring <i>P</i><sub>6</sub>-free graphs
@@ Property / cites work: Four-coloring <i>P</i><sub>6</sub>-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time solvable optimization problems on graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+Q4954442
@@ Property / cites work: Q4954442 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+On cycle transversals and their connected variants in the absence of a small linear forest
+Normal rank
@@ Property / cites work @@
+Bi‐arc graphs and the complexity of list homomorphisms
+Normal rank
@@ Property / cites work @@
+Large Induced Subgraphs via Triangulations and CMSO
+Normal rank
@@ Property / cites work @@
+Finding large induced sparse subgraphs in             <i>               c               <sub>&gt;t</sub>             </i>             -free graphs in quasipolynomial time
+Normal rank
@@ Property / cites work @@
+Closing complexity gaps for coloring problems on \(H\)-free graphs
+Normal rank
@@ Property / cites work @@
+\(H\)-colouring \(P_t\)-free graphs in subexponential time
+Normal rank
@@ Property / cites work @@
+Polynomial-time algorithm for Maximum Weight Independent Set on <i>P</i><sub>6</sub>-free graphs
+Normal rank
@@ Property / cites work @@
+A dichotomy for minimum cost graph homomorphisms
@@ Property / cites work: A dichotomy for minimum cost graph homomorphisms / rank @@
+Normal rank
@@ Property / cites work @@
+A survey of the algorithmic aspects of modular decomposition
+Normal rank
@@ Property / cites work @@
+Q4828516
@@ Property / cites work: Q4828516 / rank @@
+Normal rank
@@ Property / cites work @@
+Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time
+Normal rank
@@ Property / cites work @@
+Improved complexity results on \(k\)-coloring \(P_t\)-free graphs
+Normal rank
@@ Property / cites work @@
+Independent Set in <i>P</i><sub>5</sub>-Free Graphs in Polynomial Time
+Normal rank
@@ Property / cites work @@
+A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
+Normal rank
@@ Property / cites work @@
+Q3128916
@@ Property / cites work: Q3128916 / rank @@
+Normal rank
@@ Property / cites work @@
+On maximal independent sets of vertices in claw-free graphs
+Normal rank
@@ Property / cites work @@
+Subexponential-time algorithms for finding large induced sparse subgraphs
+Normal rank
@@ Property / cites work @@
+Subexponential algorithms for variants of the homomorphism problem in string graphs
+Normal rank
@@ Property / cites work @@
+Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
+Normal rank
@@ Property / cites work @@
+The maximum k-colorable subgraph problem for chordal graphs
+Normal rank
@@ Property / OpenAlex ID @@
+W3205762307
@@ Property / OpenAlex ID: W3205762307 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5163508