A graphic generalization of arithmetic.
Khan, Bilal, Bhutani, Kiran R., Kahrobaei, Delaram (2007)
Integers
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Colorings and nowhere-zero flows of graphs in terms of Berlekamp's switching game.”
A graphic generalization of arithmetic.
Nowhere-zero -flows of supergraphs.
Mohar, Bojan, Škrekovski, Riste (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Flows on the join of two graphs
Robert Lukoťka, Edita Rollová (2013)
Mathematica Bohemica
Similarity:
The join of two graphs and is a graph formed from disjoint copies of and by connecting each vertex of to each vertex of . We determine the flow number of the resulting graph. More precisely, we prove that the join of two graphs admits a nowhere-zero -flow except for a few classes of graphs: a single vertex joined with a graph containing an isolated vertex or an odd circuit tree component, a single edge joined with a graph containing only isolated edges, a single edge plus...
Colorings and orientations of matrices and graphs.
Schauz, Uwe (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Nowhere-zero 3-flows in squares of graphs.
Xu, Rui, Zhang, Cun-Quan (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Flexible color lists in Alon and Tarsi's theorem, and time scheduling with unreliable participants.
Schauz, Uwe (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A paintability version of the combinatorial Nullstellensatz, and list colorings of -partite -uniform hypergraphs.
Schauz, Uwe (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The graph polynomial and the number of proper vertex coloring
Michael Tarsi (1999)
Annales de l'institut Fourier
Similarity:
Alon and Tarsi presented in a previous paper a certain weighted sum over the set of all proper -colorings of a graph, which can be computed from its graph polynomial. The subject of this paper is another combinatorial interpretation of the same quantity, expressed in terms of the numbers of certain modulo flows in the graph. Some relations between graph parameters can be obtained by combining these two formulas. For example: The number of proper 3-colorings of a 4-regular graph and...
Small forbidden configurations. III.
Anstee, R.P., Kamoosi, N. (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The alternating sign matrix polytope.
Striker, Jessica (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity: