The Existence of a Path with Two Blocks in Digraphs

IF 0.6 4区 数学 Q3 MATHEMATICS Graphs and Combinatorics Pub Date : 2024-03-12 DOI:10.1007/s00373-024-02759-8
Amine El Sahili, Maidoun Mortada, Sara Nasser
{"title":"The Existence of a Path with Two Blocks in Digraphs","authors":"Amine El Sahili, Maidoun Mortada, Sara Nasser","doi":"10.1007/s00373-024-02759-8","DOIUrl":null,"url":null,"abstract":"<p>We give a new elementary proof of El Sahili conjecture El Sahili (Discrete Math 287:151–153, 2004) stating that any <i>n</i>-chromatic digraph <i>D</i>, with <span>\\(n\\ge 4\\)</span>, contains a path with two blocks of order <i>n</i>.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":"34 1","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2024-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Graphs and Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s00373-024-02759-8","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

We give a new elementary proof of El Sahili conjecture El Sahili (Discrete Math 287:151–153, 2004) stating that any n-chromatic digraph D, with \(n\ge 4\), contains a path with two blocks of order n.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
在数图中存在有两个块的路径
我们给出了 El Sahili 猜想的一个新的基本证明 El Sahili(《离散数学》287:151-153,2004 年)指出,任何 n 个色度数图 D,在 \(n\ge 4\) 的情况下,都包含一条有两个 n 阶块的路径。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Graphs and Combinatorics
Graphs and Combinatorics 数学-数学
CiteScore
1.00
自引率
14.30%
发文量
160
审稿时长
6 months
期刊介绍: Graphs and Combinatorics is an international journal devoted to research concerning all aspects of combinatorial mathematics. In addition to original research papers, the journal also features survey articles from authors invited by the editorial board.
期刊最新文献
An Efficient Algorithm to Compute the Toughness in Graphs with Bounded Treewidth Existential Closure in Line Graphs The Planar Turán Number of $$\{K_4,C_5\}$$ and $$\{K_4,C_6\}$$ On the Complexity of Local-Equitable Coloring in Claw-Free Graphs with Small Degree New Tools to Study 1-11-Representation of Graphs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1