The following pages link to (Q4083461):
Displaying 50 items.
- Billiard quorums on the grid (Q287209) (← links)
- Better approximation algorithms for \textsc{Set Splitting} and \textsc{Not-All-Equal Sat} (Q293272) (← links)
- Finding shortest paths between graph colourings (Q309791) (← links)
- On generalizations of separating and splitting families (Q311557) (← links)
- Color-bounded hypergraphs. VI: Structural and functional jumps in complexity (Q383764) (← links)
- Grassmann homomorphism and Hajós-type theorems (Q518115) (← links)
- The availability of crumbling wall quorum systems (Q678870) (← links)
- On the complexity of colouring by superdigraphs of bipartite graphs (Q686279) (← links)
- \(K_3\)-WORM colorings of graphs: lower chromatic number and gaps in the chromatic spectrum (Q726653) (← links)
- 1-2-3 Conjecture in digraphs: more results and directions (Q777370) (← links)
- Planar graphs without short even cycles are near-bipartite (Q777449) (← links)
- On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems (Q791320) (← links)
- Signsolvability revisited (Q795898) (← links)
- Coloring problems on bipartite graphs of small diameter (Q831342) (← links)
- Computational aspects of monotone dualization: a brief survey (Q943839) (← links)
- On the complexity of recognizing directed path families (Q967290) (← links)
- Orderings of uniquely colorable hypergraphs (Q997065) (← links)
- On the fractional chromatic number of monotone self-dual Boolean functions (Q1011723) (← links)
- Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees (Q1045172) (← links)
- Even cycles in directed graphs (Q1084409) (← links)
- Computational complexity of terminological reasoning in BACK (Q1104128) (← links)
- A note on line digraphs and the directed max-cut problem (Q1174433) (← links)
- Graph properties and hypergraph colourings (Q1184854) (← links)
- On-line algorithms for 2-coloring hypergraphs via chip games (Q1210300) (← links)
- The complexity of some problems related to GRAPH 3-COLORABILITY (Q1281385) (← links)
- Square critically 3-chromatic hypergraphs (Q1292808) (← links)
- Approximability of maximum splitting of k-sets and some other Apx-complete problems (Q1350605) (← links)
- On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs (Q1356685) (← links)
- On stable cutsets in line graphs (Q1400002) (← links)
- Planar quorums (Q1575641) (← links)
- Trees, paths, stars, caterpillars and spiders (Q1635718) (← links)
- Independent feedback vertex sets for graphs of bounded diameter (Q1685021) (← links)
- On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs (Q1707976) (← links)
- Critical vertices and edges in \(H\)-free graphs (Q1730263) (← links)
- Independent feedback vertex set for \(P_5\)-free graphs (Q1739097) (← links)
- Testing hypergraph colorability (Q1770424) (← links)
- A priori TSP in the scenario model (Q1801079) (← links)
- An algebraic point of view of the data structures of database systems (Q1823030) (← links)
- Quorum systems constructed from combinatorial designs (Q1854450) (← links)
- The complexity of generalized graph colorings (Q1923585) (← links)
- Colorability of mixed hypergraphs and their chromatic inversions (Q1956247) (← links)
- An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance (Q2018887) (← links)
- Partitioning the vertices of a cubic graph into two total dominating sets (Q2030435) (← links)
- Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization (Q2032346) (← links)
- On list \(k\)-coloring convex bipartite graphs (Q2056881) (← links)
- Hard problems that quickly become very easy (Q2059897) (← links)
- Role coloring bipartite graphs (Q2081494) (← links)
- Colouring generalized claw-free graphs and graphs of large girth: bounding the diameter (Q2167905) (← links)
- On packing time-respecting arborescences (Q2172082) (← links)
- Colouring \((P_r + P_s)\)-free graphs (Q2182090) (← links)
