Algebraic characterization of uniquely vertex colorable graphs
From MaRDI portal
Publication:2477631
DOI10.1016/j.jctb.2007.08.004zbMath1134.05026arXivmath/0606565OpenAlexW2153918277WikidataQ56389092 ScholiaQ56389092MaRDI QIDQ2477631
Troels Windfeldt, Christopher J. Hillar
Publication date: 14 March 2008
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0606565
Related Items
Unnamed Item, Graph coloring and semidefinite rank, Gröbner bases techniques for an \(S\)-packing \(k\)-coloring of a graph, An algebraic formulation of hypergraph colorings, Sum-of-squares certificates for Vizing's conjecture via determining Gröbner bases, Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz, Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz, Algebraic Properties of ModuloqComplete ℓ-Wide Families, Some Combinatorial Applications of Gröbner Bases, On robust colorings of Hamming-distance graphs, Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares, Maximal ambiguously \(k\)-colorable graphs, Privacy-preserving data splitting: a combinatorial approach, Exploiting Chordal Structure in Polynomial Ideals: A Gröbner Bases Approach, 2-colorability of \(r\)-uniform hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Colorings and orientations of graphs
- On uniquely 3-colorable graphs
- Stable sets and polynomials
- On small uniquely vertex-colourable graphs and Xu's conjecture
- \(K_r\)-free uniquely vertex colorable graphs with minimum possible edges
- Gröbner bases and graph colorings
- The size of uniquely colorable graphs