【24h】

A Degree-Condition for (s, t)-Supereulerian Graphs

机译:(s,t)-超欧拉图的度条件

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

摘要

For two integers s ≥ 0, t ≥ 0, G is (s, t)-superlerian, if anyX, Y is contained in E(G) with X ∩ Y = φ, where |X| ≤ s, |Y| ≤t,G has a spanning eulerian subgraph H such that X is contained in E(H) and Y ∩ E(H) = φ. It is obvious that G is supereulerian if and only if G is (0, 0)-supereulerian. In this note, we have proved that when G is a (t + 2)-edge-connected simple graph on n vertices, if n ≥ 21 and δ(G) ≥n/5 +t, then G is (3, t)-supererlerian or can be contracted to some well classified special graphs.
机译:对于两个整数s≥0,t≥0,G是(s,t)-超勒斯,如果有X,Y包含在E(G)中,且X∩Y =φ,其中| X | ≤s,| Y | ≤t,G具有跨度的欧拉子图H,使得X包含在E(H)中,并且Y∩E(H)=φ。很明显,当且仅当G是(0,0)-超欧拉时,G才是超欧拉。在本说明中,我们证明了,当G是n个顶点上的(t + 2)边连接的简单图时,如果n≥21且δ(G)≥n/ 5 + t,则G为(3,t )-supererlerian或可以收缩到一些分类良好的特殊图形。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号