5 papers · 1 filter
Stacking and Clearing in Directed Graph Pebbling
Tamás Csernák, Lajos Soukup
Suppose that pebbles are distributed on the vertices of a directed graph D. A directed pebbling step u -> v along an arc u -> v removes two pebbles from u and places one pebble on…
Stacking and clearing in graph pebbling
Tamás Csernák, Lajos Soukup
Suppose that pebbles are distributed on the vertices of a graph G. A pebbling step along an edge uv removes two pebbles from u and places one pebble on v. We introduce two new grap…
Trivial coloring of Cartesian product of graphs
Tamás Csernák
A coloring of a direct product of graphs is said to be {\em trivial} iff it is induced by some coloring of a factor of the product. A graph is trivially power colorable iff eve…
On Proper Colorings of Functions
Tamás Csernák
We investigate the infinite version of the -switch problem of Greenwell and Lovász. Given infinite cardinals and , for functions we say that they are total…
List Chromatic Number of Finitary Matroids: A Generalization of Seymour's Result
Tamás Csernák
Seymour proved that the chromatic numbers and the list chromatic numbers of loop-free finite matroids are the same. In this paper we prove the same statement for infinite, loop-fre…