REVIEW
On the Assignment Graphs of Oriented Graphs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
classification
math.CO
keywords
assignmentgraphgraphspebblingisomorphicorientedtraversableassignments
Signed reviews
read the original abstract
In this paper, we extend the ideas of graph pebbling to oriented graphs and find a classification for all graphs with fully traversable pebbling assignments that are isomorphic to their assignment graph. We then give some cases in which a graph with a non-fully traversable pebbling assignment is isomorphic to its assignment graph.
Discussion (0). Continue with ORCID to comment.