Journal of Graph Theory最新文献

筛选
英文 中文
Face Sizes and the Connectivity of the Dual 脸的大小和双连通性
IF 1 3区 数学
Journal of Graph Theory Pub Date : 2025-07-13 DOI: 10.1002/jgt.23277
Gunnar Brinkmann, Kenta Noguchi, Heidi Van den Camp
{"title":"Face Sizes and the Connectivity of the Dual","authors":"Gunnar Brinkmann,&nbsp;Kenta Noguchi,&nbsp;Heidi Van den Camp","doi":"10.1002/jgt.23277","DOIUrl":"https://doi.org/10.1002/jgt.23277","url":null,"abstract":"<p>For each <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>c</mi>\u0000 \u0000 <mo>≥</mo>\u0000 \u0000 <mn>1</mn>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math>, we prove tight lower bounds on face sizes that must be present to allow 1- or 2-cuts in simple duals of <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>c</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math>-connected maps. Using these bounds, we determine the smallest genus on which a <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>c</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math>-connected map can have a simple dual with a 2-cut and give lower and some upper bounds for the smallest genus on which a <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>c</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math>-connected map can have a simple dual with a 1-cut.</p>","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"110 4","pages":"379-391"},"PeriodicalIF":1.0,"publicationDate":"2025-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jgt.23277","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145272966","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On Some Algorithmic and Structural Results on Flames 关于火焰的一些算法和结构结果
IF 1 3区 数学
Journal of Graph Theory Pub Date : 2025-07-13 DOI: 10.1002/jgt.23283
Dávid Szeszlér
{"title":"On Some Algorithmic and Structural Results on Flames","authors":"Dávid Szeszlér","doi":"10.1002/jgt.23283","DOIUrl":"https://doi.org/10.1002/jgt.23283","url":null,"abstract":"&lt;p&gt;A directed graph &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;F&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; with a root node &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;r&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; is called a &lt;i&gt;flame&lt;/i&gt; if for every vertex &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;v&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; other than &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;r&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; the local edge-connectivity value &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;msub&gt;\u0000 &lt;mi&gt;λ&lt;/mi&gt;\u0000 \u0000 &lt;mi&gt;F&lt;/mi&gt;\u0000 &lt;/msub&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;r&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;v&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; from &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;r&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; to &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;v&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; is equal to &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;msub&gt;\u0000 &lt;mi&gt;ϱ&lt;/mi&gt;\u0000 \u0000 &lt;mi&gt;F&lt;/mi&gt;\u0000 &lt;/msub&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;v&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 ","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"110 4","pages":"392-397"},"PeriodicalIF":1.0,"publicationDate":"2025-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jgt.23283","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145272965","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On the Minimum Degree of Minimally t -Tough, Claw-Free Graphs 关于最小t -坚韧无爪图的最小度
IF 1 3区 数学
Journal of Graph Theory Pub Date : 2025-07-10 DOI: 10.1002/jgt.23278
Hui Ma, Xiaomin Hu, Weihua Yang
{"title":"On the Minimum Degree of Minimally \u0000 \u0000 \u0000 \u0000 t\u0000 \u0000 \u0000 -Tough, Claw-Free Graphs","authors":"Hui Ma,&nbsp;Xiaomin Hu,&nbsp;Weihua Yang","doi":"10.1002/jgt.23278","DOIUrl":"https://doi.org/10.1002/jgt.23278","url":null,"abstract":"<div>\u0000 \u0000 <p>A graph is called minimally <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>t</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math>-tough if the toughness of the graph is <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>t</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math> but the removal of any edge decreases the toughness. Katona and Varga conjectured that every minimally <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>t</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math>-tough graph has a vertex of degree <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mrow>\u0000 <mo>⌈</mo>\u0000 \u0000 <mrow>\u0000 <mn>2</mn>\u0000 \u0000 <mi>t</mi>\u0000 </mrow>\u0000 \u0000 <mo>⌉</mo>\u0000 </mrow>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math>. Matthews and Sumner proved that the toughness of any claw-free graph is always equal to half its connectivity, which implies that the toughness of a claw-free graph is always an integer or half of an integer. Katona et al. proved that this conjecture holds for minimally <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>t</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math>-tough, claw-free graphs if <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>t</mi>\u0000 \u0000 <mo>∈</mo>\u0000 \u0000 <mfenced>\u0000 <mrow>\u0000 <mfrac>\u0000 <mn>1</mn>\u0000 \u0000 <mn>2</mn>\u0000 </mfrac>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <mn>1</mn>\u0000 </mrow>\u0000 </mfenced>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math>, and we proved before that this is also true if <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>t</mi>\u0000 \u0000 <mo>=</mo>\u0000 \u0000 <mfrac>\u0000 ","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"110 3","pages":"366-373"},"PeriodicalIF":1.0,"publicationDate":"2025-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145022285","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Chordal Graphs, Even-Hole-Free Graphs and Sparse Obstructions to Bounded Treewidth 弦图、偶孔图和有界树宽的稀疏障碍
IF 1 3区 数学
Journal of Graph Theory Pub Date : 2025-07-08 DOI: 10.1002/jgt.23276
Sepehr Hajebi
{"title":"Chordal Graphs, Even-Hole-Free Graphs and Sparse Obstructions to Bounded Treewidth","authors":"Sepehr Hajebi","doi":"10.1002/jgt.23276","DOIUrl":"https://doi.org/10.1002/jgt.23276","url":null,"abstract":"&lt;p&gt;Even-hole-free graphs pose a central challenge in identifying hereditary classes of bounded treewidth. We investigate this matter by presenting and studying the following conjecture: for an integer &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;t&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;≥&lt;/mo&gt;\u0000 \u0000 &lt;mn&gt;4&lt;/mn&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; and a graph &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;H&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;, every even-hole-free graph of large enough treewidth has an induced subgraph isomorphic to either &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;msub&gt;\u0000 &lt;mi&gt;K&lt;/mi&gt;\u0000 \u0000 &lt;mi&gt;t&lt;/mi&gt;\u0000 &lt;/msub&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; or &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;H&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;, if (and only if) &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;H&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; is a &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;msub&gt;\u0000 &lt;mi&gt;K&lt;/mi&gt;\u0000 \u0000 &lt;mn&gt;4&lt;/mn&gt;\u0000 &lt;/msub&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;-free chordal graph. The “only if” part follows from the properties of the so-called &lt;i&gt;layered wheels&lt;/i&gt;, a construction by Sintiari and Trotignon consisting of (even-hole, &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;msub&gt;\u0000 &lt;mi&gt;K&lt;/mi&gt;\u0000 \u0000 &lt;mn&gt;4&lt;/mn&gt;\u0000 &lt;/msub&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;)-free graphs with arbitrarily large treewidth. Alecu et al. proved recently that the conjecture holds in two special cases: (a) when &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 ","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"110 3","pages":"351-365"},"PeriodicalIF":1.0,"publicationDate":"2025-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jgt.23276","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145022009","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Recognizing Trees From Incomplete Decks 从不完整的甲板上识别树木
IF 1 3区 数学
Journal of Graph Theory Pub Date : 2025-07-01 DOI: 10.1002/jgt.23274
Gabriëlle Zwaneveld
{"title":"Recognizing Trees From Incomplete Decks","authors":"Gabriëlle Zwaneveld","doi":"10.1002/jgt.23274","DOIUrl":"https://doi.org/10.1002/jgt.23274","url":null,"abstract":"&lt;p&gt;Given a graph &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;G&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;, the unlabeled subgraphs &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;G&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;−&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;v&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; are called the cards of &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;G&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;. The deck of &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;G&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; is the multiset &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;{&lt;/mo&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;G&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;−&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;v&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;:&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;v&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;∈&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;V&lt;/mi&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;G&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 \u0000 &lt;mo&gt;}&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;. Wendy Myrvold showed that a disconnected graph and a connected graph both on &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;n&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; vertices have at most &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;⌊&lt;/mo&gt;\u0000 ","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"110 3","pages":"322-336"},"PeriodicalIF":1.0,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jgt.23274","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145021753","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Supereulerian Oriented Graphs With Large Arc-Strong Connectivity 具有大弧强连通性的超欧拉图
IF 1 3区 数学
Journal of Graph Theory Pub Date : 2025-07-01 DOI: 10.1002/jgt.23254
Jia Wei, Hong-Jian Lai
{"title":"Supereulerian Oriented Graphs With Large Arc-Strong Connectivity","authors":"Jia Wei,&nbsp;Hong-Jian Lai","doi":"10.1002/jgt.23254","DOIUrl":"https://doi.org/10.1002/jgt.23254","url":null,"abstract":"&lt;div&gt;\u0000 \u0000 &lt;p&gt;An oriented graph is a digraph whose underlying graph is simple. Bang-Jensen and Thomassé conjectured that every digraph &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;D&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; with arc-strong connectivity &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;λ&lt;/mi&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;D&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; at least as large as its independence number &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;α&lt;/mi&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;D&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; must be supereulerian. We introduce max–min ditrails in a digraph and investigate the relationship between the arc-strong connectivity &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;λ&lt;/mi&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;D&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; and matching number &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;msup&gt;\u0000 &lt;mi&gt;α&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;′&lt;/mo&gt;\u0000 &lt;/msup&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 \u0000 &lt;mi&gt;D&lt;/mi&gt;\u0000 \u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; to assure the supereulericity of an oriented graph &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 \u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;D&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;. Utilizing the max–min ditrails with the related counting arguments, it is proved that every oriented graph &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 ","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"110 3","pages":"298-312"},"PeriodicalIF":1.0,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145021818","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Ramsey-Type Theorem on Deficiency 关于亏的一个ramsey型定理
IF 1 3区 数学
Journal of Graph Theory Pub Date : 2025-07-01 DOI: 10.1002/jgt.23271
Jin Sun, Xinmin Hou
{"title":"A Ramsey-Type Theorem on Deficiency","authors":"Jin Sun,&nbsp;Xinmin Hou","doi":"10.1002/jgt.23271","DOIUrl":"https://doi.org/10.1002/jgt.23271","url":null,"abstract":"<div>\u0000 \u0000 <p>The Ramsey Theorem says that a graph <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>G</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math> has bounded order if and only if <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>G</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math> contains no complete graph <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <msub>\u0000 <mi>K</mi>\u0000 \u0000 <mi>n</mi>\u0000 </msub>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math> or empty graph <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <msub>\u0000 <mi>E</mi>\u0000 \u0000 <mi>n</mi>\u0000 </msub>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math> as its induced subgraph. The Gyárfás-Sumner conjecture states that a graph <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>G</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math> has bounded chromatic number if and only if it contains no induced subgraph isomorphic to <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <msub>\u0000 <mi>K</mi>\u0000 \u0000 <mi>n</mi>\u0000 </msub>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math> or a tree <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>T</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math>. The deficiency of a graph is the number of vertices that cannot be covered by a maximum matching. In this paper, we prove a Ramsey-type theorem for deficiency, that is, we characterize all the forbidden induced subgraphs for graphs <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>G</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math> with bounded deficiency. In this application, we answer a question proposed by Fujita et al. (2006).</p>\u0000 </div>","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"110 3","pages":"313-321"},"PeriodicalIF":1.0,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145021902","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Minimizing the Determinant of the Graph Laplacian 最小化图的拉普拉斯行列式
IF 1 3区 数学
Journal of Graph Theory Pub Date : 2025-07-01 DOI: 10.1002/jgt.23275
Nathan Albin, Joan Lind, Anna Melikyan, Pietro Poggi-Corradini
{"title":"Minimizing the Determinant of the Graph Laplacian","authors":"Nathan Albin,&nbsp;Joan Lind,&nbsp;Anna Melikyan,&nbsp;Pietro Poggi-Corradini","doi":"10.1002/jgt.23275","DOIUrl":"https://doi.org/10.1002/jgt.23275","url":null,"abstract":"<div>\u0000 \u0000 <p>In this paper, we study extremal values for the determinant of the weighted graph Laplacian under simple nondegeneracy conditions on the weights. We derive necessary and sufficient conditions for the determinant of the Laplacian to be bounded away from zero and for the existence of a minimizing set of weights. These conditions are given both in terms of properties of random spanning trees and in terms of a type of density on graphs. These results generalize and extend the work of Melikyan.</p>\u0000 </div>","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"110 3","pages":"337-350"},"PeriodicalIF":1.0,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145021754","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Spanning Plane Subgraphs of 1-Plane Graphs 生成1-平面图的平面子图
IF 1 3区 数学
Journal of Graph Theory Pub Date : 2025-06-22 DOI: 10.1002/jgt.23273
Kenta Noguchi, Katsuhiro Ota, Yusuke Suzuki
{"title":"Spanning Plane Subgraphs of 1-Plane Graphs","authors":"Kenta Noguchi,&nbsp;Katsuhiro Ota,&nbsp;Yusuke Suzuki","doi":"10.1002/jgt.23273","DOIUrl":"https://doi.org/10.1002/jgt.23273","url":null,"abstract":"<p>A graph drawn on the plane is called 1-plane if each edge is crossed at most once by another edge. In this paper, we show that every 4-edge-connected 1-plane graph has a connected spanning plane subgraph. We also show that there exist infinitely many 4-connected 1-plane graphs that have no 2-connected spanning plane subgraphs. Moreover, we consider the condition of <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>k</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math> and <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>l</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math> such that every <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>k</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math>-connected 1-plane graph has an <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>l</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math>-connected spanning plane subgraph.</p>","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"110 3","pages":"290-297"},"PeriodicalIF":1.0,"publicationDate":"2025-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jgt.23273","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145022311","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Minimum Non-Chromatic- λ -Choosable Graphs 最小非色λ可选图
IF 1 3区 数学
Journal of Graph Theory Pub Date : 2025-06-15 DOI: 10.1002/jgt.23267
Jialu Zhu, Xuding Zhu
{"title":"Minimum Non-Chromatic-\u0000 \u0000 \u0000 \u0000 λ\u0000 \u0000 \u0000 -Choosable Graphs","authors":"Jialu Zhu,&nbsp;Xuding Zhu","doi":"10.1002/jgt.23267","DOIUrl":"https://doi.org/10.1002/jgt.23267","url":null,"abstract":"<div>\u0000 \u0000 <p>For a multiset <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>λ</mi>\u0000 \u0000 <mo>=</mo>\u0000 \u0000 <mrow>\u0000 <mo>{</mo>\u0000 \u0000 <mrow>\u0000 <msub>\u0000 <mi>k</mi>\u0000 \u0000 <mn>1</mn>\u0000 </msub>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <msub>\u0000 <mi>k</mi>\u0000 \u0000 <mn>2</mn>\u0000 </msub>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <mo>…</mo>\u0000 \u0000 <mo>,</mo>\u0000 \u0000 <msub>\u0000 <mi>k</mi>\u0000 \u0000 <mi>q</mi>\u0000 </msub>\u0000 </mrow>\u0000 \u0000 <mo>}</mo>\u0000 </mrow>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math> of positive integers, let <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <msub>\u0000 <mi>k</mi>\u0000 \u0000 <mi>λ</mi>\u0000 </msub>\u0000 \u0000 <mo>=</mo>\u0000 \u0000 <msubsup>\u0000 <mo>∑</mo>\u0000 \u0000 <mrow>\u0000 <mi>i</mi>\u0000 \u0000 <mo>=</mo>\u0000 \u0000 <mn>1</mn>\u0000 </mrow>\u0000 \u0000 <mi>q</mi>\u0000 </msubsup>\u0000 \u0000 <msub>\u0000 <mi>k</mi>\u0000 \u0000 <mi>i</mi>\u0000 </msub>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math>. A <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>λ</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math>-list assignment of <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 \u0000 <mrow>\u0000 <mi>G</mi>\u0000 </mrow>\u0000 </mrow>\u0000 </semantics></math> is a list assignment <span></span><math>\u0000 ","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"110 3","pages":"283-289"},"PeriodicalIF":1.0,"publicationDate":"2025-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145022308","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"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学术文献互助群
群 号:604180095
Book学术官方微信