Pages that link to "Item:Q1363645"
From MaRDI portal
The following pages link to Generalized coloring for tree-like graphs (Q1363645):
Displaying 48 items.
- The parameterised complexity of list problems on graphs of bounded treewidth (Q342709) (← links)
- Incremental list coloring of graphs, parameterized by conservation (Q391091) (← links)
- Data reduction for graph coloring problems (Q393081) (← links)
- On the parameterized complexity of coloring graphs in the absence of a linear forest (Q450579) (← links)
- Using local search to speed up filtering algorithms for some NP-hard constraints (Q545546) (← links)
- Building graphs from colored trees (Q612947) (← links)
- On the complexity of some colorful problems parameterized by treewidth (Q627124) (← links)
- Consensus models: computational complexity aspects in modern approaches to the list coloring problem (Q638544) (← links)
- Acyclic and star colorings of cographs (Q643025) (← links)
- On algorithms for (\(P_5\), gem)-free graphs (Q817767) (← links)
- Coloring problems on bipartite graphs of small diameter (Q831342) (← links)
- Time slot scheduling of compatible jobs (Q880586) (← links)
- Weighted coloring: further complexity and approximability results (Q1045908) (← links)
- Complexity of list coloring problems with a fixed total number of colors (Q1348378) (← links)
- Counting \(H-\)colorings of partial \(k-\)trees (Q1603695) (← links)
- Combinatorial problems on \(H\)-graphs (Q1689915) (← links)
- List total colorings of series-parallel graphs (Q1775015) (← links)
- Parameterized complexity of vertex colouring (Q1811065) (← links)
- A note on recognizing an old friend in a new place: list coloring and the zero-temperature Potts model (Q2019203) (← links)
- Measuring what matters: a hybrid approach to dynamic programming with treewidth (Q2040028) (← links)
- On list \(k\)-coloring convex bipartite graphs (Q2056881) (← links)
- Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs (Q2067633) (← links)
- All subgraphs of a wheel are 5-coupled-choosable (Q2115842) (← links)
- Closing complexity gaps for coloring problems on \(H\)-free graphs (Q2252529) (← links)
- The \(d\)-precoloring problem for \(k\)-degenerate graphs (Q2370443) (← links)
- Answering conjunctive queries with inequalities (Q2402612) (← links)
- Weighted and locally bounded list-colorings in split graphs, cographs, and partial \(k\)-trees (Q2420639) (← links)
- Coloring graphs without short cycles and long induced paths (Q2440105) (← links)
- Bandwidth consecutive multicolorings of graphs (Q2445874) (← links)
- Hard coloring problems in low degree planar bipartite graphs (Q2506359) (← links)
- List coloring in the absence of two subgraphs (Q2636800) (← links)
- Open Problems on Graph Coloring for Special Graph Classes (Q2827799) (← links)
- A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← links)
- List Coloring in the Absence of a Linear Forest (Q3104770) (← links)
- Generation of colour-constrained spanning trees with application in symbolic circuit analysis (Q4355497) (← links)
- Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure (Q5013568) (← links)
- Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. (Q5092404) (← links)
- Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints (Q5387639) (← links)
- Slightly Superexponential Parameterized Problems (Q5745079) (← links)
- On coloring problems with local constraints (Q5891093) (← links)
- On coloring problems with local constraints (Q5891606) (← links)
- Exploring the complexity boundary between coloring and list-coloring (Q5896984) (← links)
- Exploring the complexity boundary between coloring and list-coloring (Q5899384) (← links)
- On \(H\)-topological intersection graphs (Q5925535) (← links)
- Clique‐width: Harnessing the power of atoms (Q6062871) (← links)
- On the complexity of coloring ‐graphs (Q6092550) (← links)
- List 3-coloring on comb-convex and caterpillar-convex bipartite graphs (Q6591467) (← links)
- Parameterized problems complete for nondeterministic FPT time and logarithmic space (Q6614886) (← links)
