位置：成果数据库 > 期刊 > 期刊详情页
Linear Polynomial-Time Algorithms To Construct 4-Connected 4-Regular Locally Connected Claw-Free Gra
  • ISSN号：0302-9743
  • 期刊名称：Lecture Notes in Computer Science
  • 时间：0
  • 页码：329-333
  • 语言：英文
  • 相关项目：图的偶因子及参数的稳定性
作者： Li MingCHu|Liu Hong|Xiong Liming|
同期刊论文项目
图的偶因子及参数的稳定性
期刊论文 31
同项目期刊论文
几类特殊的M2-等可覆盖图
A Note about Bezdeks Conjecture on Covering an Annulus by Strips
The hamiltonian index of a 2-connected graph
Hamilton-connected indices of graphs
Closure, stability and iterated line graphs with a 2-factor
On distance local connectivity and the hamiltonian index
Traceability of line graphs
The structure of even factors in claw-free graphs
The existence of even factors in iterated line graphs
Connected even factors in claw-free graphs
P-3-equicoverable graphs - Research on H-equicoverable graphs
线图上次泛圈性的两条独立边的度和条件
闭无爪图在圈闭包运算下哈密尔顿指数的稳定性
Toughness and hamiltonicity in k-trees
Even Factors with Degree at Most Four in Claw-Free Graphs
An algorithm for a decomposition of weighted digraphs: with applications to life cycle analysis in e
二分图中存在包含经过给定边的大圈的2-因子的度条件
线图中2-因子分支数一些结果的改进
The upper bound of the number of cycles in a 2-factor of a line graph
On the 2-factor index of a graph
Quadrangularly connected claw-free graphs
二分图中存在包含经过给定边的大国的2-因子的度条件
二分图中含有经过给定点的大圈的2-因子的度条件