Pages that link to "Item:Q1229753"

The following pages link to A note on the complexity of the chromatic number problem (Q1229753):

Displaying 50 items.

• On the parameterized complexity of b-\textsc{chromatic number} (Q340565) (← links)
• Coloring, location and domination of corona graphs (Q372395) (← links)
• Minimal dominating sets in graph classes: combinatorial bounds and enumeration (Q387008) (← links)
• Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
• Branch and recharge: exact algorithms for generalized domination (Q639293) (← links)
• New plain-exponential time classes for graph homomorphism (Q639844) (← links)
• Enumerating maximal independent sets with applications to graph colouring. (Q703280) (← links)
• Dual parameterization of weighted coloring (Q786042) (← links)
• A new backtracking algorithm for generating the family of maximal independent sets of a graph (Q786833) (← links)
• Improved edge-coloring with three colors (Q837164) (← links)
• An improved algorithm for approximating the chromatic number of \(G_{n,p}\) (Q845732) (← links)
• An improved exact algorithm for the domatic number problem (Q845906) (← links)
• Exact algorithms for exact satisfiability and number of perfect matchings (Q958212) (← links)
• Efficiency in exponential time for domination-type problems (Q1003475) (← links)
• A note on coloring sparse random graphs (Q1025963) (← links)
• Enumeration and maximum number of minimal connected vertex covers in graphs (Q1678095) (← links)
• Complexity of Grundy coloring and its variants (Q1752449) (← links)
• An exact algorithm for the channel assignment problem (Q1764816) (← links)
• On the span in channel assignment problems: Bounds, computing and counting (Q1810659) (← links)
• Dominating set based exact algorithms for \(3\)-coloring (Q1944084) (← links)
• Exact algorithms for edge domination (Q1945174) (← links)
• Trimmed Moebius inversion and graphs of bounded degree (Q1959390) (← links)
• Improved algorithm to determine 3-colorability of graphs with minimum degree at least 7 (Q2028085) (← links)
• Exact algorithms for counting 3-colorings of graphs (Q2081467) (← links)
• Moderate exponential-time algorithms for scheduling problems (Q2095519) (← links)
• Vertex coloring of a graph for memory constrained scenarios (Q2183733) (← links)
• Sharp separation and applications to exact and parameterized algorithms (Q2429363) (← links)
• New exact algorithms for the 2-constraint satisfaction problem (Q2437759) (← links)
• An exact algorithm for the minimum dominating clique problem (Q2456374) (← links)
• The parameterized complexity of maximality and minimality problems (Q2470035) (← links)
• Open problems around exact algorithms (Q2473037) (← links)
• The resolution complexity of random graph \(k\)-colorability (Q2581545) (← links)
• Harmonious coloring: parameterized algorithms and upper bounds (Q2632021) (← links)
• Parameterized and exact algorithms for class domination coloring (Q2659082) (← links)
• Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration (Q2891369) (← links)
• Parameterized and Exact Algorithms for Class Domination Coloring (Q2971145) (← links)
• Invitation to Algorithmic Uses of Inclusion–Exclusion (Q3012908) (← links)
• Tropical lower bound for extended formulations. II. Deficiency graphs of matrices (Q3120460) (← links)
• On the Fine-Grained Complexity of Rainbow Coloring (Q3174728) (← links)
• Harmonious Coloring: Parameterized Algorithms and Upper Bounds (Q3181062) (← links)
• New Plain-Exponential Time Classes for Graph Homomorphism (Q3392969) (← links)
• On maximum number of minimal dominating sets in graphs (Q3439327) (← links)
• Lower Bounds for the Graph Homomorphism Problem (Q3448809) (← links)
• A Moderately Exponential Time Algorithm for Full Degree Spanning Tree (Q3502671) (← links)
• Exact Algorithms for Edge Domination (Q3503591) (← links)
• The Number of Maximal Independent Sets in a Tree (Q3708817) (← links)
• (Q3879256) (← links)
• Efficient bounds on a branch and bound algorithm for graph colouration (Q4009325) (← links)
• Feedback Vertex Sets in Tournaments (Q4908824) (← links)
• From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge between Graphs and Alternating Matrix Spaces (Q4994986) (← links)