The following pages link to 3-coloring in time (Q4652410):
Displaying 38 items.
- Algorithms and almost tight results for 3-colorability of small diameter graphs (Q261372) (← links)
- An approximate algorithm for the chromatic number of graphs (Q283679) (← links)
- A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between (Q414887) (← links)
- Regular inference as vertex coloring (Q465248) (← links)
- Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring (Q533417) (← links)
- Branch and recharge: exact algorithms for generalized domination (Q639293) (← links)
- Improved simulation of nondeterministic Turing machines (Q764330) (← links)
- Improved edge-coloring with three colors (Q837164) (← links)
- Solving connected dominating set faster than \(2^n\) (Q958203) (← links)
- Computing branchwidth via efficient triangulations and blocks (Q967315) (← links)
- Simple and improved parameterized algorithms for multiterminal cuts (Q987378) (← links)
- Efficient approximation of Min Set Cover by moderately exponential algorithms (Q1019736) (← links)
- A note on coloring sparse random graphs (Q1025963) (← links)
- Three colorability characterized by shrinking of locally connected subgraphs into triangles (Q1708265) (← links)
- On the representation number of a crown graph (Q1752592) (← links)
- Dominating set based exact algorithms for \(3\)-coloring (Q1944084) (← links)
- Decomposition of realizable fuzzy relations (Q1955454) (← links)
- Enumerating the edge-colourings and total colourings of a regular graph (Q1956248) (← 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)
- Alternative representations of P systems solutions to the graph colouring problem (Q2299885) (← links)
- Word-representability of Toeplitz graphs (Q2334044) (← links)
- Improved fixed parameter tractable algorithms for two ``edge'' problems: MAXCUT and MAXDAG (Q2379999) (← links)
- Colorings with few colors: counting, enumeration and combinatorial bounds (Q2392249) (← links)
- Exact algorithms for maximum induced matching (Q2407101) (← links)
- Linear-programming design and analysis of fast algorithms for Max 2-CSP (Q2427689) (← links)
- Sharp separation and applications to exact and parameterized algorithms (Q2429363) (← links)
- Determining the \(L(2,1)\)-span in polynomial space (Q2446848) (← links)
- Solving SCS for bounded length strings in fewer than \(2^n\) steps (Q2448115) (← links)
- Improved worst-case complexity for the MIN 3-SET COVERING problem (Q2643796) (← links)
- Complement, Complexity, and Symmetric Representation (Q2949722) (← links)
- Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds (Q3057611) (← links)
- Deconstructing Intractability: A Case Study for Interval Constrained Coloring (Q3637114) (← links)
- Word-Representable Graphs: a Survey (Q4558287) (← links)
- ON 4-EDGE COLORING OF CUBIC GRAPHS CONTAINING “SMALL” NON-PLANAR SUBGRAPHS (Q4639461) (← links)
- (Q5028438) (← links)
- Exponential-time quantum algorithms for graph coloring problems (Q5970782) (← links)
