因子为三角形的有向图的上升子图分解

IF 0.5 4区 数学 Q3 MATHEMATICS
Andrea D. Austin, Brian C. Wagner
{"title":"因子为三角形的有向图的上升子图分解","authors":"Andrea D. Austin, Brian C. Wagner","doi":"10.7151/dmgt.2306","DOIUrl":null,"url":null,"abstract":"Abstract In 1987, Alavi, Boals, Chartrand, Erdős, and Oellermann conjectured that all graphs have an ascending subgraph decomposition (ASD). In a previous paper, Wagner showed that all oriented complete balanced tripartite graphs have an ASD. In this paper, we will show that all orientations of an oriented graph that can be factored into triangles with a large portion of the triangles being transitive have an ASD. We will also use the result to obtain an ASD for any orientation of complete multipartite graphs with 3n partite classes each containing 2 vertices (a K(2 : 3n)) or 4 vertices (a K(4 : 3n)).","PeriodicalId":48875,"journal":{"name":"Discussiones Mathematicae Graph Theory","volume":null,"pages":null},"PeriodicalIF":0.5000,"publicationDate":"2022-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Ascending Subgraph Decompositions of Oriented Graphs that Factor into Triangles\",\"authors\":\"Andrea D. Austin, Brian C. Wagner\",\"doi\":\"10.7151/dmgt.2306\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract In 1987, Alavi, Boals, Chartrand, Erdős, and Oellermann conjectured that all graphs have an ascending subgraph decomposition (ASD). In a previous paper, Wagner showed that all oriented complete balanced tripartite graphs have an ASD. In this paper, we will show that all orientations of an oriented graph that can be factored into triangles with a large portion of the triangles being transitive have an ASD. We will also use the result to obtain an ASD for any orientation of complete multipartite graphs with 3n partite classes each containing 2 vertices (a K(2 : 3n)) or 4 vertices (a K(4 : 3n)).\",\"PeriodicalId\":48875,\"journal\":{\"name\":\"Discussiones Mathematicae Graph Theory\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2022-06-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discussiones Mathematicae Graph Theory\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.7151/dmgt.2306\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discussiones Mathematicae Graph Theory","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.7151/dmgt.2306","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

摘要1987年,Alavi、Boals、Chartrand、Erdõs和Oellermann推测所有图都有升子图分解(ASD)。在之前的一篇论文中,Wagner证明了所有有向完全平衡三元图都有ASD。在本文中,我们将证明可以分解为三角形的有向图的所有方向,其中很大一部分三角形是传递的,都具有ASD。我们还将使用该结果来获得具有3n个部分类的完全多部分图的任何方向的ASD,每个部分类包含2个顶点(aK(2:3n))或4个顶点(a K(4:3n))。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Ascending Subgraph Decompositions of Oriented Graphs that Factor into Triangles
Abstract In 1987, Alavi, Boals, Chartrand, Erdős, and Oellermann conjectured that all graphs have an ascending subgraph decomposition (ASD). In a previous paper, Wagner showed that all oriented complete balanced tripartite graphs have an ASD. In this paper, we will show that all orientations of an oriented graph that can be factored into triangles with a large portion of the triangles being transitive have an ASD. We will also use the result to obtain an ASD for any orientation of complete multipartite graphs with 3n partite classes each containing 2 vertices (a K(2 : 3n)) or 4 vertices (a K(4 : 3n)).
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
2.20
自引率
0.00%
发文量
22
审稿时长
53 weeks
期刊介绍: The Discussiones Mathematicae Graph Theory publishes high-quality refereed original papers. Occasionally, very authoritative expository survey articles and notes of exceptional value can be published. The journal is mainly devoted to the following topics in Graph Theory: colourings, partitions (general colourings), hereditary properties, independence and domination, structures in graphs (sets, paths, cycles, etc.), local properties, products of graphs as well as graph algorithms related to these topics.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信