Pages that link to "Item:Q4210665"
From MaRDI portal
The following pages link to Graph colorings with local constraints -- a survey (Q4210665):
Displaying 50 items.
- Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum (Q1827854) (← links)
- Edge dominating set and colorings on graphs with fixed clique-width (Q1861574) (← links)
- Algorithms for vertex-partitioning problems on graphs with fixed clique-width. (Q1874418) (← links)
- Extending precolorings of subgraphs of locally planar graphs (Q1883295) (← links)
- Uncolorable mixed hypergraphs (Q1962044) (← links)
- Choosability and paintability of the lexicographic product of graphs (Q2030438) (← links)
- On list \(k\)-coloring convex bipartite graphs (Q2056881) (← links)
- Improved bounds for some facially constrained colorings (Q2107748) (← links)
- Colouring generalized claw-free graphs and graphs of large girth: bounding the diameter (Q2167905) (← links)
- Colouring \((P_r + P_s)\)-free graphs (Q2182090) (← links)
- Flexibility of planar graphs -- sharpening the tools to get lists of size four (Q2243143) (← links)
- Closing complexity gaps for coloring problems on \(H\)-free graphs (Q2252529) (← links)
- List coloring in the absence of a linear forest (Q2258070) (← links)
- Incidence choosability of graphs (Q2312648) (← links)
- Extending colorings of planar graphs (Q2334079) (← links)
- Domination, coloring and stability in \(P_5\)-reducible graphs (Q2341757) (← links)
- Characterization of \((2m,m)\)-paintable graphs (Q2344816) (← links)
- Locally planar graphs are 5-paintable (Q2346337) (← links)
- The \(d\)-precoloring problem for \(k\)-degenerate graphs (Q2370443) (← links)
- Bounds on partial online list colouring (Q2398499) (← links)
- On the thinness and proper thinness of a graph (Q2414456) (← links)
- Complexity and approximability of extended spanning star forest problems in general and complete graphs (Q2419107) (← links)
- Local 7-coloring for planar subgraphs of unit disk graphs (Q2430012) (← links)
- Coloring graphs without short cycles and long induced paths (Q2440105) (← links)
- Towards an on-line version of Ohba's conjecture (Q2441619) (← links)
- Generalised graph colouring by a hybrid of local search and constraint programming (Q2467347) (← links)
- Extending precolorings to circular colorings (Q2496199) (← links)
- List coloring of Cartesian products of graphs (Q2501567) (← links)
- Hard coloring problems in low degree planar bipartite graphs (Q2506359) (← links)
- Worm colorings (Q2516682) (← links)
- Inequalities involving the irredundance number of a graph (Q2576844) (← links)
- List coloring in the absence of two subgraphs (Q2636800) (← links)
- Precoloring extension involving pairs of vertices of small distance (Q2636808) (← links)
- Oriented list colorings of graphs (Q2725322) (← links)
- List colourings of graphs (Q2741180) (← links)
- Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum (Q2741457) (← links)
- Open Problems on Graph Coloring for Special Graph Classes (Q2827799) (← links)
- Partial online list coloring of graphs (Q2862550) (← links)
- 4-Coloring H-Free Graphs When H Is Small (Q2891376) (← links)
- List colorings of \(K_5\)-minor-free graphs with special list assignments (Q2911050) (← links)
- Deciding the On-line Chromatic Number of a Graph with Pre-coloring Is PSPACE-Complete (Q2947029) (← links)
- A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← links)
- A survey of graph coloring - its types, methods and applications (Q2978431) (← links)
- Narrowing Down the Gap on the Complexity of Coloring P k -Free Graphs (Q3057613) (← links)
- Data Reduction for Graph Coloring Problems (Q3088272) (← links)
- Coloring Graphs without Short Cycles and Long Induced Paths (Q3088283) (← links)
- List Coloring in the Absence of a Linear Forest (Q3104770) (← links)
- LIST POINT ARBORICITY OF GRAPHS (Q3166733) (← links)
- Choosability of P 5-Free Graphs (Q3182940) (← links)
- (Q3304125) (← links)
