Pages that link to "Item:Q2477631"
From MaRDI portal
The following pages link to Algebraic characterization of uniquely vertex colorable graphs (Q2477631):
Displaying 15 items.
- Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz (Q650840) (← links)
- On robust colorings of Hamming-distance graphs (Q1991409) (← links)
- Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares (Q2029005) (← links)
- Privacy-preserving data splitting: a combinatorial approach (Q2035465) (← links)
- Graph coloring and semidefinite rank (Q2164723) (← links)
- Maximal ambiguously \(k\)-colorable graphs (Q2284731) (← links)
- 2-colorability of \(r\)-uniform hypergraphs (Q2318778) (← links)
- Gröbner bases techniques for an \(S\)-packing \(k\)-coloring of a graph (Q2401415) (← links)
- Exploiting Chordal Structure in Polynomial Ideals: A Gröbner Bases Approach (Q2818203) (← links)
- Some Combinatorial Applications of Gröbner Bases (Q3014931) (← links)
- Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz (Q3552513) (← links)
- Algebraic Properties of Modulo<i>q</i>Complete ℓ-Wide Families (Q3557494) (← links)
- (Q5206906) (← links)
- Sum-of-squares certificates for Vizing's conjecture via determining Gröbner bases (Q6170824) (← links)
- Graph coloring and semidefinite rank (Q6589762) (← links)
