Pages that link to "Item:Q534566"

The following pages link to Parameterized complexity of coloring problems: treewidth versus vertex cover (Q534566):

Displaying 41 items.

• Incremental list coloring of graphs, parameterized by conservation (Q391091) (← links)
• Data reduction for graph coloring problems (Q393081) (← links)
• Complexity of conflict-free colorings of graphs (Q484316) (← links)
• On the complexity of some colorful problems parameterized by treewidth (Q627124) (← links)
• Parameterizing by the number of numbers (Q692894) (← links)
• Finding vertex-surjective graph homomorphisms (Q715053) (← links)
• On bounded-degree vertex deletion parameterized by treewidth (Q765338) (← links)
• On directed covering and domination problems (Q1735678) (← links)
• Parameterized complexity of vertex colouring (Q1811065) (← links)
• Parameterized complexity of list coloring and max coloring (Q2097212) (← links)
• An analysis of the parameterized complexity of periodic timetabling (Q2142676) (← links)
• Combinatorial \(n\)-fold integer programming and applications (Q2205969) (← links)
• Computing \(L(p, 1)\)-labeling with combined parameters (Q2232248) (← links)
• Optimal data reduction for graph coloring using low-degree polynomials (Q2272594) (← links)
• Tree-coloring problems of bounded treewidth graphs (Q2292136) (← links)
• Parameterized complexity of distance labeling and uniform channel assignment problems (Q2413966) (← links)
• Weighted and locally bounded list-colorings in split graphs, cographs, and partial \(k\)-trees (Q2420639) (← links)
• Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems (Q2817849) (← links)
• Open Problems on Graph Coloring for Special Graph Classes (Q2827799) (← links)
• Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics (Q2891355) (← links)
• Exact and Parameterized Algorithms for (k, i)-Coloring (Q2971658) (← links)
• Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover (Q3630207) (← links)
• (Q5009486) (← links)
• Iterated Type Partitions (Q5041190) (← links)
• Algorithmic Applications of Tree-Cut Width (Q5048301) (← links)
• Computing L(p,1)-Labeling with Combined Parameters (Q5049996) (← links)
• Grundy Distinguishes Treewidth from Pathwidth (Q5096586) (← links)
• Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials (Q5111881) (← links)
• On Directed Covering and Domination Problems (Q5136265) (← links)
• (Q5874480) (← links)
• (Q5874489) (← links)
• Fixed-parameter tractability of \((n-k)\) list coloring (Q5918286) (← links)
• Exploring the gap between treedepth and vertex cover through vertex integrity (Q5918674) (← links)
• Structural parameterizations of budgeted graph coloring (Q5918737) (← links)
• Exploring the gap between treedepth and vertex cover through vertex integrity (Q5925679) (← links)
• Structural parameterizations of budgeted graph coloring (Q5925707) (← links)
• Colouring a dominating set without conflicts: \(q\)-subset square colouring (Q6077071) (← links)
• Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization (Q6107887) (← links)
• Parameterized complexity for iterated type partitions and modular-width (Q6126724) (← links)
• Extended MSO model checking via small vertex integrity (Q6185940) (← links)
• The parameterized complexity of maximum betweenness centrality (Q6636087) (← links)