The Complexity of Pebbling in Diameter Two Graphs

SIAM Journal on Discrete Mathematics - United States
doi 10.1137/11084412x
Full Text
Abstract

Available in full text

Categories
Mathematics
Date
Authors
Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

Optimal Pebbling and Rubbling of Graphs With Given Diameter

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

Optimal Pebbling Number of Graphs With Given Minimum Degree

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

On the Complexity of Reinforcement in Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2016English

On the Steiner 4-Diameter of Graphs

Journal of Interconnection Networks
Computer NetworksCommunications
2018English

The Complexity of Dissociation Set Problems in Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2011English

The Degree/Diameter Problem in Maximal Planar Bipartite Graphs

Electronic Journal of Combinatorics
CombinatoricsApplied MathematicsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2016English

Complexity of Disjoint Paths Problems in Planar Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1993English

The Complexity of the List Partition Problem for Graphs

SIAM Journal on Discrete Mathematics
Mathematics
2008English

The Complexity of Embedding Graphs Into Binary Trees

English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy