位置：成果数据库 > 期刊 > 期刊详情页
Potentially F2m+i-graphic sequences
  • ISSN号：0315-3681
  • 期刊名称：Utilitas Mathematica
  • 时间：0
  • 页码：87-95
  • 语言：英文
  • 相关项目：图的度序列与连通图中的若干专题研究
作者： 尹建华|陈纲|
同期刊论文项目
图的度序列与连通图中的若干专题研究
期刊论文 29
同项目期刊论文
A characterization for a graphic sequence to be potentially K2,s-graphic
A characterization for a graphic sequence to be potentially Cr-graphic
Variations of two classical Turan-type extremal results
Posa-条件下的图的Z4-连通性
广义有谊图乘积上的Graham pebbling猜想
A Gale-Ryser type characterization of potentially Ks,t-bigraphic pairs
Graphic sequences with a realization containing intersecting cliques
A short constructive proof of A.R. Rao’s characterization of potentially Kr+1-graphic sequence
The proof of a conjecture due to Snevily
几类二部图的Pebbling数
An ODE-based trust region method for unconstrained optimization problems
The smallest degree sum that yields potentially Kr1,...,rl,2,s-graphic sequences
A nonmonotonic trust region algorithm for a class of semi-infinite minimax programming
蕴含F'k1,k2;1-可图序列
蕴含K5-E(P2)的正可图序列
An extremal problem on potentially Kr,r-ke-graphic sequences
Conditions for r-graphic sequences to be potentially Km+1(r)-graphic
C5的刺图的Pebbling数和2-Pebbling性质
A hybrid trust region algorithm for unconstrained optimization
Posa-condition and nowhere-zero 3-flows
A characterization for a graphic sequence to have a realization containing a desired cycle
An ODE-Based trust region filter algorithm for unconstrained optimization
On the characterization of potentially K1,1,s-graphic sequences.
A Rao-type characterization for a sequence to have a realization containing a split graph
有一个实现包含Kr＋1的可图序列
广义友谊图乘积上的Graham pebbling猜想
r-可图序列与r-完全子图