发布求助
文献互助 智能选刊 最新文献

Discussiones Mathematicae Graph Theory最新文献

筛选
英文 中文
Vertex partitioning of graphs into odd induced subgraphs 图的奇诱导子图的顶点划分
IF 0.7 4区 数学
Discussiones Mathematicae Graph Theory Pub Date : 2023-01-01 DOI: 10.7151/dmgt.2371
A. Aashtab, S. Akbari, M. Ghanbari, Arman Shidani
{"title":"Vertex partitioning of graphs into odd induced subgraphs","authors":"A. Aashtab, S. Akbari, M. Ghanbari, Arman Shidani","doi":"10.7151/dmgt.2371","DOIUrl":"https://doi.org/10.7151/dmgt.2371","url":null,"abstract":"A graph G is called an odd (even) graph if for every vertex v ∈ V (G), dG(v) is odd (even). Let G be a graph of even order. Scott in 1992 proved that the vertices of every connected graph of even order can be partitioned into some odd induced forests. We denote the minimum number of odd induced subgraphs which partition V (G) by od(G). If all of the subgraphs are forests, then we denote it by odF (G). In this paper, we show that if G is a connected subcubic graph of even order or G is a connected planar graph of even order, then odF (G) ≤ 4. Moreover, we show that for every tree T of even order odF (T ) ≤ 2 and for every unicyclic graph G of even order odF (G) ≤ 3. Also, we prove that if G is claw-free, then V (G) can be partitioned into at most ∆(G)−1 induced forests and possibly one independent set. Furthermore, we demonstrate that the vertex set of the line graph of a tree can be partitioned into at most two odd induced subgraphs and possibly one independent set.","PeriodicalId":48875,"journal":{"name":"Discussiones Mathematicae Graph Theory","volume":"33 1","pages":"385-399"},"PeriodicalIF":0.7,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90190914","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Acyclic chromatic index of IC-planar graphs ic -平面图的无环色指数
IF 0.7 4区 数学
Discussiones Mathematicae Graph Theory Pub Date : 2023-01-01 DOI: 10.7151/dmgt.2487
Wenyao Song, L. Miao, Yue Zhao, Haiyang Zhu
{"title":"Acyclic chromatic index of IC-planar graphs","authors":"Wenyao Song, L. Miao, Yue Zhao, Haiyang Zhu","doi":"10.7151/dmgt.2487","DOIUrl":"https://doi.org/10.7151/dmgt.2487","url":null,"abstract":"","PeriodicalId":48875,"journal":{"name":"Discussiones Mathematicae Graph Theory","volume":"168 1","pages":"965-978"},"PeriodicalIF":0.7,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89018570","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Strong chromatic index of claw-free graphs with edge weight seven 边权为7的无爪图的强色指数
IF 0.7 4区 数学
Discussiones Mathematicae Graph Theory Pub Date : 2023-01-01 DOI: 10.7151/dmgt.2497
Yuquan Lin, Wensong Lin
{"title":"Strong chromatic index of claw-free graphs with edge weight seven","authors":"Yuquan Lin, Wensong Lin","doi":"10.7151/dmgt.2497","DOIUrl":"https://doi.org/10.7151/dmgt.2497","url":null,"abstract":"","PeriodicalId":48875,"journal":{"name":"Discussiones Mathematicae Graph Theory","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71129914","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Chvátal-Erdős type theorem for path-connectivity 路径连通性的Chvátal-Erdős类型定理
IF 0.7 4区 数学
Discussiones Mathematicae Graph Theory Pub Date : 2023-01-01 DOI: 10.7151/dmgt.2493
Guantao Chen, Zhiquan Hu, Yaping Wu
{"title":"A Chvátal-Erdős type theorem for path-connectivity","authors":"Guantao Chen, Zhiquan Hu, Yaping Wu","doi":"10.7151/dmgt.2493","DOIUrl":"https://doi.org/10.7151/dmgt.2493","url":null,"abstract":"","PeriodicalId":48875,"journal":{"name":"Discussiones Mathematicae Graph Theory","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71130027","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Characterization of alpha-excellent 2-trees α -优2-树的表征
4区 数学
Discussiones Mathematicae Graph Theory Pub Date : 2023-01-01 DOI: 10.7151/dmgt.2520
Magda Dettlaff, Michael A. Henning, Jerzy Topp
{"title":"Characterization of <i>alpha</i>-excellent <i>2</i>-trees","authors":"Magda Dettlaff, Michael A. Henning, Jerzy Topp","doi":"10.7151/dmgt.2520","DOIUrl":"https://doi.org/10.7151/dmgt.2520","url":null,"abstract":"","PeriodicalId":48875,"journal":{"name":"Discussiones Mathematicae Graph Theory","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135913896","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Domination in graphs and the removal of a matching 图中的支配和匹配的移除
4区 数学
Discussiones Mathematicae Graph Theory Pub Date : 2023-01-01 DOI: 10.7151/dmgt.2516
Geoffrey Boyer, Wayne Goddard
{"title":"Domination in graphs and the removal of a matching","authors":"Geoffrey Boyer, Wayne Goddard","doi":"10.7151/dmgt.2516","DOIUrl":"https://doi.org/10.7151/dmgt.2516","url":null,"abstract":"","PeriodicalId":48875,"journal":{"name":"Discussiones Mathematicae Graph Theory","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135601422","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Rainbow disjoint union of clique and matching in edge-colored complete graph 边色完全图中团的彩虹不相交并与匹配
IF 0.7 4区 数学
Discussiones Mathematicae Graph Theory Pub Date : 2023-01-01 DOI: 10.7151/dmgt.2483
Zemin Jin, Junqi Gu
{"title":"Rainbow disjoint union of clique and matching in edge-colored complete graph","authors":"Zemin Jin, Junqi Gu","doi":"10.7151/dmgt.2483","DOIUrl":"https://doi.org/10.7151/dmgt.2483","url":null,"abstract":"","PeriodicalId":48875,"journal":{"name":"Discussiones Mathematicae Graph Theory","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71129848","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Spanning trails avoiding and containing given edges 生成路径，避免并包含给定的边
IF 0.7 4区 数学
Discussiones Mathematicae Graph Theory Pub Date : 2023-01-01 DOI: 10.7151/dmgt.2505
Lei Lan, Xiaomin Li, Sulin Song, Yikang Xie, H. Lai
{"title":"Spanning trails avoiding and containing given edges","authors":"Lei Lan, Xiaomin Li, Sulin Song, Yikang Xie, H. Lai","doi":"10.7151/dmgt.2505","DOIUrl":"https://doi.org/10.7151/dmgt.2505","url":null,"abstract":"","PeriodicalId":48875,"journal":{"name":"Discussiones Mathematicae Graph Theory","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71129936","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The generalized 4-connectivity of balanced hypercubes 平衡超立方体的广义4连通性
IF 0.7 4区 数学
Discussiones Mathematicae Graph Theory Pub Date : 2023-01-01 DOI: 10.7151/dmgt.2490
Dongqin Cheng
{"title":"The generalized 4-connectivity of balanced hypercubes","authors":"Dongqin Cheng","doi":"10.7151/dmgt.2490","DOIUrl":"https://doi.org/10.7151/dmgt.2490","url":null,"abstract":"","PeriodicalId":48875,"journal":{"name":"Discussiones Mathematicae Graph Theory","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71130016","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Disjoint maximal independent sets in graphs and hypergraphs 图和超图中的不相交极大独立集
IF 0.7 4区 数学
Discussiones Mathematicae Graph Theory Pub Date : 2023-01-01 DOI: 10.7151/dmgt.2500
P. Dorbec, F. Kacı
{"title":"Disjoint maximal independent sets in graphs and hypergraphs","authors":"P. Dorbec, F. Kacı","doi":"10.7151/dmgt.2500","DOIUrl":"https://doi.org/10.7151/dmgt.2500","url":null,"abstract":"","PeriodicalId":48875,"journal":{"name":"Discussiones Mathematicae Graph Theory","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71129565","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信