首页> 外文学位 >Claw-free graphs and line graphs.
【24h】

Claw-free graphs and line graphs.

机译:无爪图和折线图。

获取原文
获取原文并翻译 | 示例

摘要

The research of my dissertation is motivated by the conjecture of Thomassen that every 4-connected line graph is hamiltonian and by the conjecture of Tutte that every 4-edge-connected graph has a no-where-zero 3-flow. Towards the hamiltonian line graph problem, we proved that every 3-connected N2-locally connected claw-free graph is hamiltonian, which was conjectured by Ryjacek in 1990; that every 4-connected line graph of an almost claw free graph is hamiltonian connected, and that every triangularly connected claw-free graph G with |E( G)| ≥ 3 is vertex pancyclic. Towards the second conjecture, we proved that every line graph of a 4-edge-connected graph is Z 3-connected.
机译:本文的研究是基于Thomassen的猜想,即每4个连接的线图都是汉密尔顿,而Tutte的猜想是,每个4边的连接图具有无处零的3流。对于哈密尔顿线图问题,我们证明了每个三连接的N2局部连接的无爪图都是哈密尔顿的,这是由Ryjacek在1990年提出的。几乎没有爪的图的每个四连通线图都是哈密顿连通的,并且每个三角形连接的无爪图G的| E(G)| ≥3是顶点全环。对于第二个猜想,我们证明了4边连接图的每个线图都是Z 3连接的。

著录项

  • 作者

    Shao, Yehong.;

  • 作者单位

    West Virginia University.;

  • 授予单位 West Virginia University.;
  • 学科 Mathematics.
  • 学位 Ph.D.
  • 年度 2005
  • 页码 55 p.
  • 总页数 55
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 数学;
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号