Supereulerian digraphs

详细信息    查看全文

• 作者：Yanmei Hong^a ; ^{lovely-hym@163.com" class="auth_mail} ; ^{yhong@fzu.edu.cn" class="auth_mail} ; Hong-Jian Lai^b ; Qinghai Liu^c ; ^{qliu@fzu.edu.cn" class="auth_mail}
• 关键词：Supereulerian
• 刊名：Discrete Mathematics
• 出版年：6 September 2014
• 年：2014
• 卷：330
• 期：Complete
• 页码：87-95
• 全文大小：417 K

文摘

A digraph D$D$ is supereulerian if D$D$ has a spanning directed eulerian subdigraph. We give a necessary condition for a digraph to be supereulerian first and then characterize the digraph D$D$ which are not supereulerian under the condition that 1092831d80d237b486c0fc446e82e" title="Click to view the MathML source">未⁺(D)+未⁻(D)≥|V(D)|−4${未}^{+}\left(D\right)+{未}^{-}\left(D\right)\ge \left|V\left(D\right)\right|-4$.