Colorings and nowhere-zero flows of graphs in terms of Berlekamp's switching game
type: Item
instance of: scholarly article
title: Colorings and nowhere-zero flows of graphs in terms of Berlekamp's switching game
zbMATH Open document ID: 1229.91087
author: Uwe Schauz
published in: The Electronic Journal of Combinatorics
publication date: 2011-06-01T00:00:00Z
full work available at URL: https://eudml.org/doc/228937
full work available at URL: v18i1p65.html
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 94B05
zbMATH DE Number: 5902995
zbMATH Keywords: nowhere-zero flow
zbMATH Keywords: graph coloring
zbMATH Keywords: Berlekamp's switching game
MaRDI profile type: Publication
Recommended article: On (k,d)-colorings and fractional nowhere-zero flows
Recommended article: Nowhere-zero \(\vec{k}\)-flows on graphs
Recommended article: On the parity of colourings and flows
Recommended article: The number of nowhere-zero flows on graphs and signed graphs
Recommended article: The Kℵ0$K^{\aleph _0}$ game: Vertex colouring
Recommended article: Coloring-flow duality of embedded graphs
Recommended article: Nowhere-zero 4-flows; simultaneous edge-colorings; and critical partial Latin squares
Recommended article: An analog of Brooks' theorem for dynamic colorings
Recommended article: On \(d\)-dimensional nowhere-zero \(r\)-flows on a graph
Recommended article: Q4537929
description: scientific article; zbMATH DE number 5902995