of a series of pebbling moves. A pebbling move on a graph consists of choosing a vertex with at least two pebbles, removing two pebbles from it, and adding...

theorem Girth Graph drawing Graph homomorphism Graph labeling Graceful labeling Graph partition Graph pebbling Graph property Graph reduction Graph-structured...

pebbles. There may also be constraints on which pebbles a player can move. Pebbling may be used to extend Ehrenfeucht–Fraïssé games. Graph pebbling:...

Philosopher's football Rhythmomachy Tak Tic-tac-toe Tic-tac-toe variants Graph pebbling Hackenbush Chopsticks (hand game) Mancala Nim Sim Sprouts Four fours...

mathematics education, and who is known for her research in graph pebbling and radio coloring of graphs. She is a professor of mathematics at California State...

algebra, but her more recent research concerns graph theory, including graph pebbling and line graphs. She is a professor of mathematics at the University...

Super Mario Bros. Black Pebble game Black-White Pebble game Acyclic pebble game One-player pebble game Token on acyclic directed graph games: Quantified boolean...

earlier works cover topics that include formal languages, unification, graph pebbling and others. Most of his research works since the early 1990s were in...

In mathematics, a dense graph is a graph in which the number of edges is close to the maximal number of edges (where every pair of vertices is connected...

Graham–Pollak theorem and Graham's pebbling conjecture in graph theory, the Coffman–Graham algorithm for approximate scheduling and graph drawing, and the Graham...

number of G {\displaystyle G} ? Graham's pebbling conjecture on the pebbling number of Cartesian products of graphs Meyniel's conjecture that cop number is...

One of his most cited papers is with Lior Pachter and Bill Voxman on Graph pebbling. This paper and Hunter's later paper with Foster added several conjectures...

The pebble motion problems, or pebble motion on graphs, are a set of related problems in graph theory dealing with the movement of multiple objects ("pebbles")...

Brilliant Pebbles was a space-based ballistic missile defense (BMD) system proposed by Lowell Wood and Edward Teller of Lawrence Livermore National Laboratory...

Pursuit–evasion (variants of which are referred to as cops and robbers and graph searching) is a family of problems in mathematics and computer science in...

In graph theory, the Laman graphs are a family of sparse graphs describing the minimally rigid systems of rods and joints in the plane. Formally, a Laman...

In graph theory, the tree-depth of a connected undirected graph G {\displaystyle G} is a numerical invariant of G {\displaystyle G} , the minimum height...

In graph theory, a path decomposition of a graph G is, informally, a representation of G as a "thickened" path graph, and the pathwidth of G is a number...

distinguish between a certain class of expander graphs called "small set expanders" and other graphs that are very far from being small set expanders...

a graph that bounds the number of edges in any subgraph. The property of having a particular matroid as its density measure is invariant under graph isomorphisms...

comprehensive. Many problems of this type can be found in Garey & Johnson (1979). Graphs occur frequently in everyday applications. Examples include biological or...

In graph theory, the cutwidth of an undirected graph is the smallest integer k {\displaystyle k} with the following property: there is an ordering of...

Laman in 1970. An efficient algorithm called the pebble game is used to identify this class of graphs. This theorem has been the inspiration for many Geiringer-Laman...

different kinds of network graphs, such as undirected rings, unidirectional rings, complete graphs, grids, directed Euler graphs, and others. A general method...

listed below have been cited to had taken overall or class wins at the Pebble Beach Concours d'Elegance. Originality, typically a car that had its original...

showed that other than one exceptional graph on 7 vertices, it is possible to obtain all permutations unless the graph is bipartite, in which case exactly...

have different character graphs and sounds representing mythological and legendary birds of China. The Chinese characters or graphs used have varied over...

attempts to solve some of the practical design problems associated with the pebbling-based PoS schemes. In using PoS for decentralized cryptocurrency, the protocol...

CS2 R&D Sega Unreleased Unreleased April 4, 1998 Sakura Taisen Teigeki Graph SIMS Sega / Red Company Unreleased Unreleased December 23, 1998 Sakura Tsuushin:...

Trump administration considered granting a permit for the construction of Pebble Mine, a copper, gold, and molybdenum mine in Bristol Bay. Gross and Sullivan...