位置：成果数据库 > 期刊 > 期刊详情页
The t-pebbling number of C5 \times C5
  • ISSN号：0012-365X
  • 期刊名称：Discrete Mathematics
  • 时间：2013.12.6
  • 页码：2778-2791
  • 相关项目：度序列与图性质及图的t-Pebbling数
作者： 高泽图|尹建华|
同期刊论文项目
度序列与图性质及图的t-Pebbling数
期刊论文 23
同项目期刊论文
A short constructive proof of A.R. Rao’s characterization of potentially Kr+1-graphic sequences
A condition that yields potentially K13,s-graphic sequences
An extension of A.R. Rao’s characterization of potentially Km+1-graphic sequences
The smallest degree sum that yields graphic sequences with a Z3-connected realization
A strong Posa condition for a graphic list to be forcibly Z3-connected
r-graphic sequences and r-complete subgraphs
A characterization for a sequence to be potentially Kr+1-e-graphic
On the t-pebbling number and the 2t-pebbling property of graphs
The 2-pebbling property for dense graphs
A complete characterization of graphic sequences with a Z(3)-connected realization
A characterization for a sequence to be potentially {Kr+1-E(P2),Kr+1-2}-graphic
On a characterization of k-trees
A variation of the classical Lovasz's (g, f)-parity factor theorem in degree sequences
A note for integer sequences to be potentially Kr+1-graphic
A variant of Niessen’s problem on degree sequences of graphs
Herscovici’s conjecture on the product of the thorn graphs of the complete graphs
A Rao-type characterization for a sequence to have a realization containing an arbitrary subgraph H
A note on packing of graphic n-tuples
r-可图序列与r-完全子图