Kathie Cameron , Aristotelis Chaniotis , Celina M.H. de Figueiredo , Sophie Spirkl
{"title":"The sandwich problem for odd-hole-free and even-hole-free graphs","authors":"Kathie Cameron , Aristotelis Chaniotis , Celina M.H. de Figueiredo , Sophie Spirkl","doi":"10.1016/j.disc.2024.114383","DOIUrl":null,"url":null,"abstract":"<div><div>For a property <span><math><mi>P</mi></math></span> of graphs, the <span><math><mi>P</mi></math></span>-<span>Sandwich-Problem</span>, introduced by Golumbic and Shamir (1993), is the following: Given a pair of graphs <span><math><mo>(</mo><msub><mrow><mi>G</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>G</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>)</mo></math></span> on the same vertex set <em>V</em>, does there exist a graph <em>G</em> such that <span><math><mi>V</mi><mo>(</mo><mi>G</mi><mo>)</mo><mo>=</mo><mi>V</mi></math></span>, <span><math><mi>E</mi><mo>(</mo><msub><mrow><mi>G</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>)</mo><mo>⊆</mo><mi>E</mi><mo>(</mo><mi>G</mi><mo>)</mo><mo>⊆</mo><mi>E</mi><mo>(</mo><msub><mrow><mi>G</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>)</mo></math></span>, and <em>G</em> satisfies <span><math><mi>P</mi></math></span>? A <em>hole</em> in a graph is an induced subgraph which is a cycle of length at least four. An odd (respectively even) hole is a hole of odd (respectively even) length. Given a class of graphs <span><math><mi>C</mi></math></span> and a graph <em>G</em> we say that <em>G</em> is <span><math><mi>C</mi></math></span><em>-free</em> if it contains no induced subgraph isomorphic to a member of <span><math><mi>C</mi></math></span>. In this paper we prove that if <span><math><mi>P</mi></math></span> is the property of being odd-hole-free or the property of being even-hole-free, then the <span><math><mi>P</mi></math></span>-<span>Sandwich-Problem</span> is <span><math><mtext>NP</mtext></math></span>-complete.</div></div>","PeriodicalId":50572,"journal":{"name":"Discrete Mathematics","volume":"348 5","pages":"Article 114383"},"PeriodicalIF":0.7000,"publicationDate":"2025-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0012365X24005144","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
For a property of graphs, the -Sandwich-Problem, introduced by Golumbic and Shamir (1993), is the following: Given a pair of graphs on the same vertex set V, does there exist a graph G such that , , and G satisfies ? A hole in a graph is an induced subgraph which is a cycle of length at least four. An odd (respectively even) hole is a hole of odd (respectively even) length. Given a class of graphs and a graph G we say that G is -free if it contains no induced subgraph isomorphic to a member of . In this paper we prove that if is the property of being odd-hole-free or the property of being even-hole-free, then the -Sandwich-Problem is -complete.
期刊介绍:
Discrete Mathematics provides a common forum for significant research in many areas of discrete mathematics and combinatorics. Among the fields covered by Discrete Mathematics are graph and hypergraph theory, enumeration, coding theory, block designs, the combinatorics of partially ordered sets, extremal set theory, matroid theory, algebraic combinatorics, discrete geometry, matrices, and discrete probability theory.
Items in the journal include research articles (Contributions or Notes, depending on length) and survey/expository articles (Perspectives). Efforts are made to process the submission of Notes (short articles) quickly. The Perspectives section features expository articles accessible to a broad audience that cast new light or present unifying points of view on well-known or insufficiently-known topics.