Pages that link to "Item:Q1327214"
From MaRDI portal
The following pages link to Algorithmic complexity of list colorings (Q1327214):
Displaying 30 items.
- Consensus models: computational complexity aspects in modern approaches to the list coloring problem (Q638544) (← links)
- List homomorphisms of graphs with bounded degrees (Q864125) (← links)
- Conservative constraint satisfaction re-revisited (Q896026) (← links)
- Extension problems with degree bounds (Q1028134) (← links)
- On the complexity of \(H\)-colouring planar graphs (Q1045065) (← links)
- Weighted coloring: further complexity and approximability results (Q1045908) (← links)
- The complexity of planar graph choosability (Q1126188) (← links)
- The algorithmic complexity of colour switching (Q1199936) (← links)
- On the complexity of a restricted list-coloring problem (Q1296975) (← links)
- List colorings and reducibility (Q1372746) (← links)
- Complexity of choosing subsets from color sets (Q1584428) (← links)
- Choosability with union separation (Q1690218) (← links)
- A not 3-choosable planar graph without 3-cycles (Q1903746) (← links)
- Improved algorithm to determine 3-colorability of graphs with minimum degree at least 7 (Q2028085) (← links)
- On list \(k\)-coloring convex bipartite graphs (Q2056881) (← links)
- List-coloring clique-hypergraphs of \(K_5\)-minor-free graphs strongly (Q2297730) (← links)
- 3-choosability of planar graphs with \((\leqslant 4)\)-cycles far apart (Q2434715) (← links)
- Hard coloring problems in low degree planar bipartite graphs (Q2506359) (← links)
- List coloring in the absence of two subgraphs (Q2636800) (← links)
- Exact Algorithms for Weighted Coloring in Special Classes of Tree and Cactus Graphs (Q2819518) (← links)
- Open Problems on Graph Coloring for Special Graph Classes (Q2827799) (← links)
- Filling the complexity gaps for colouring planar and bounded degree graphs (Q3299212) (← links)
- Near-optimal list colorings (Q4521554) (← links)
- Precoloring Extension III: Classes of Perfect Graphs (Q4883061) (← links)
- Space complexity of list <i>H</i>-colouring: a dichotomy (Q5383985) (← links)
- Exploring the complexity boundary between coloring and list-coloring (Q5899384) (← links)
- Amenable colorings (Q5906786) (← links)
- Graph isomorphism restricted by lists (Q5918143) (← links)
- List 3-coloring on comb-convex and caterpillar-convex bipartite graphs (Q6591467) (← links)
- Flexibility of planar graphs without 4-cycles (Q6621243) (← links)
