Pages that link to "Item:Q817768"

The following pages link to Equitable colorings of bounded treewidth graphs (Q817768):

Displaying 19 items.

• Parameterized complexity of coloring problems: treewidth versus vertex cover (Q534566) (← links)
• Equitable coloring on total graph of bigraphs and central graph of cycles and paths (Q539352) (← links)
• On the complexity of some colorful problems parameterized by treewidth (Q627124) (← links)
• Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem (Q653316) (← links)
• On the computational complexity of vertex integrity and component order connectivity (Q727981) (← links)
• Decomposition, reformulation, and diving in university course timetabling (Q1038298) (← links)
• On the equitable choosability of the disjoint union of stars (Q2084783) (← links)
• Partitioning graphs into induced subgraphs (Q2283104) (← links)
• Tree-coloring problems of bounded treewidth graphs (Q2292136) (← links)
• Equitable colorings of corona multiproducts of graphs (Q2409797) (← links)
• Weighted and locally bounded list-colorings in split graphs, cographs, and partial \(k\)-trees (Q2420639) (← links)
• The \(k\)-path coloring problem in graphs of bounded treewidth: an application in integrated circuit manufacturing (Q2661539) (← links)
• A $c^k n$ 5-Approximation Algorithm for Treewidth (Q2799353) (← links)
• On Equitable Coloring of Central Graphs and Total Graphs (Q2839223) (← links)
• On equitable colouring of Knödel graphs (Q2935368) (← links)
• Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms (Q4971668) (← links)
• Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization (Q6107887) (← links)
• Parameterized complexity for iterated type partitions and modular-width (Q6126724) (← links)
• Complexity aspects of restrained Roman domination in graphs (Q6132244) (← links)