AbstractA multi-graph G on n vertices is (k,ℓ)-sparse if every subset of n′⩽n vertices spans at most kn′-ℓ edges. G is tight if, in addition, it has exactly kn-ℓ edges. For integer values k and ℓ∈[0,2k), we characterize the (k,ℓ)-sparse graphs via a family of simple, elegant and efficient algorithms called the (k,ℓ)-pebble games
Graph pebbling is a game on a connected graph G in which pebbles are placed on the vertices of G. A ...
Graph pebbling is a game played on a connected graph G. A player purchases pebbles at a dollar a pie...
Abstract. In a graph G whose vertices contain pebbles, a pebbling move uv removes two pebbles from u...
A multi-graph $G$ on n vertices is $(k,l)$-sparse if every subset of $n'≤n$ vertices spans at most $...
A multi-graph G on n vertices is (k,ℓ)-sparse if every subset of n′⩽n vertices spans at most kn′-ℓ...
AbstractA multi-graph G on n vertices is (k,ℓ)-sparse if every subset of n′⩽n vertices spans at most...
AbstractA hypergraph G=(V,E) is (k,ℓ)-sparse if no subset V′⊂V spans more than k|V′|−ℓ hyperedges. W...
A hypergraph G=(V,E) is (k,ℓ)-sparse if no subset V′⊂V spans more than k|V′|−ℓ hyperedges. We charac...
AbstractIn this paper we consider Maker–Breaker games, played on the edges of sparse graphs. For a g...
We describe a new algorithm, the (k, ℓ)-pebble game with colors, and use it to obtain a characteriza...
Pebble games are single-player games on DAGs involving placing and moving pebbles on nodes of the gr...
Graph pebbling is a network model for studying whether or not a given supply of discrete pebbles can...
A skeletal framework is an embedding of a nite graph into d-sapce. A nite graph can be represented a...
Sparse graphs and their associated matroids play an important role in rigidity theory, where they ca...
Given a distribution of pebbles on the vertices of a graph G, a pebbling move takes two pebbles from...
Graph pebbling is a game on a connected graph G in which pebbles are placed on the vertices of G. A ...
Graph pebbling is a game played on a connected graph G. A player purchases pebbles at a dollar a pie...
Abstract. In a graph G whose vertices contain pebbles, a pebbling move uv removes two pebbles from u...
A multi-graph $G$ on n vertices is $(k,l)$-sparse if every subset of $n'≤n$ vertices spans at most $...
A multi-graph G on n vertices is (k,ℓ)-sparse if every subset of n′⩽n vertices spans at most kn′-ℓ...
AbstractA multi-graph G on n vertices is (k,ℓ)-sparse if every subset of n′⩽n vertices spans at most...
AbstractA hypergraph G=(V,E) is (k,ℓ)-sparse if no subset V′⊂V spans more than k|V′|−ℓ hyperedges. W...
A hypergraph G=(V,E) is (k,ℓ)-sparse if no subset V′⊂V spans more than k|V′|−ℓ hyperedges. We charac...
AbstractIn this paper we consider Maker–Breaker games, played on the edges of sparse graphs. For a g...
We describe a new algorithm, the (k, ℓ)-pebble game with colors, and use it to obtain a characteriza...
Pebble games are single-player games on DAGs involving placing and moving pebbles on nodes of the gr...
Graph pebbling is a network model for studying whether or not a given supply of discrete pebbles can...
A skeletal framework is an embedding of a nite graph into d-sapce. A nite graph can be represented a...
Sparse graphs and their associated matroids play an important role in rigidity theory, where they ca...
Given a distribution of pebbles on the vertices of a graph G, a pebbling move takes two pebbles from...
Graph pebbling is a game on a connected graph G in which pebbles are placed on the vertices of G. A ...
Graph pebbling is a game played on a connected graph G. A player purchases pebbles at a dollar a pie...
Abstract. In a graph G whose vertices contain pebbles, a pebbling move uv removes two pebbles from u...
DOI
Add to ORKG