Colorings and nowhere-zero flows of graphs in terms of Berlekamp's switching game
From MaRDI portal
Publication:540052
zbMath1229.91087MaRDI QIDQ540052
Publication date: 1 June 2011
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/228937
Games involving graphs (91A43) Linear codes (general theory) (94B05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)
Related Items (2)
Some new characterizations of graph colorability and of blocking sets of projective spaces ⋮ A Gale-Berlekamp permutation-switching problem
This page was built for publication: Colorings and nowhere-zero flows of graphs in terms of Berlekamp's switching game
