...
机译:具有较小匹配数的超欧拉图和2连通的哈密尔顿无爪图
Department of Mathematics, HuiZhou University, HuiZhou, Guangdong 561007, China;
Department of Mathematics, Beijing Jiaotong University, Beijing, China;
School of Mathematics and Statistics, Jiangsu Normal University, Xuzhou, Jiangsu, 221116, China;
Department of Mathematics, West Virginia University, Morgantown, WV 26506, USA;
Department of Mathematics, West Virginia University, Morgantown, WV 26506, USA;
supereulerian graphs; collapsible graphs; reductions; contraction characterizations;
机译:具有小周长的超欧拉图和三连通哈密顿无爪图
机译:包含顶点的和度的2连通哈密顿无爪图
机译:规则2连通无爪图中的哈密顿环
机译:Superureaterian图表和小匹配数字
机译:3连通,无爪,广义无网图是哈密顿量。
机译:给定总约束支配数的无爪图的刻画
机译:具有大4度和的Nonhamiltonian 2连通无爪图
机译:识别具有大最小度的无爪哈密顿图