Pebbling in semi-2-trees (Q526223): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Glenn H. Hurlbert / rank
Normal rank
 
Property / author
 
Property / author: Glenn H. Hurlbert / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C82 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C38 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C57 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B10 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6713446 / rank
 
Normal rank
Property / zbMATH Keywords
 
pebbling number
Property / zbMATH Keywords: pebbling number / rank
 
Normal rank
Property / zbMATH Keywords
 
\(k\)-trees
Property / zbMATH Keywords: \(k\)-trees / rank
 
Normal rank
Property / zbMATH Keywords
 
\(k\)-paths
Property / zbMATH Keywords: \(k\)-paths / rank
 
Normal rank
Property / zbMATH Keywords
 
class 0
Property / zbMATH Keywords: class 0 / rank
 
Normal rank
Property / zbMATH Keywords
 
complexity
Property / zbMATH Keywords: complexity / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2017.02.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2964197924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pebbling in Split Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pebbling in 2-paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pebbling Algorithms in Diameter Two Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503345 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pebbling and optimal pebbling in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved pebbling bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pebbling in Hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pebbling in diameter two graphs and products of paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Pebbling in Diameter Two Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(t\)-pebbling and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: General graph pebbling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of pebbling reachability and solvability in planar and outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Graph Pebbling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386076 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:26, 13 July 2024

scientific article
Language Label Description Also known as
English
Pebbling in semi-2-trees
scientific article

    Statements

    Pebbling in semi-2-trees (English)
    0 references
    0 references
    0 references
    0 references
    10 May 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    pebbling number
    0 references
    \(k\)-trees
    0 references
    \(k\)-paths
    0 references
    class 0
    0 references
    complexity
    0 references
    0 references