The following pages link to Gröbner bases and graph colorings (Q1892780):
Displaying 18 items.
- On the coloured graph structure of Lusztig's canonical basis (Q1359511) (← links)
- A general approach to deriving the \(g\)-good-neighbor conditional diagnosability of interconnection networks (Q1711835) (← links)
- Privacy-preserving data splitting: a combinatorial approach (Q2035465) (← links)
- Standard complexes of matroids and lattice paths (Q2155637) (← links)
- 2-colorability of \(r\)-uniform hypergraphs (Q2318778) (← links)
- Computing the chromatic number using graph decompositions via matrix rank (Q2330132) (← links)
- Gröbner bases techniques for an \(S\)-packing \(k\)-coloring of a graph (Q2401415) (← links)
- Algebraic characterization of uniquely vertex colorable graphs (Q2477631) (← links)
- Graph colourings and solutions of systems of equations over finite fields (Q2509305) (← links)
- Graph-coloring ideals: Nullstellensatz certificates, Gröbner bases for chordal graphs, and hardness of Gröbner bases (Q2819750) (← links)
- Some Combinatorial Applications of Gröbner Bases (Q3014931) (← links)
- (Q3193427) (← links)
- (Q4440642) (← links)
- Computing the Chromatic Number Using Graph Decompositions via Matrix Rank (Q5009610) (← links)
- A note on the reducedness and Gröbner bases of Specht ideals (Q5038120) (← links)
- Gröbner Bases of Radical Li–Li Type Ideals Associated with Partitions (Q6057806) (← links)
- An algebraic formulation of hypergraph colorings (Q6106296) (← links)
- Sum-of-squares certificates for Vizing's conjecture via determining Gröbner bases (Q6170824) (← links)
