Detecting wheels-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Detecting wheels

Published:2014 Issue:1 Volume:8 Page:111-122
ISSN:1452-8630
Container-title:Applicable Analysis and Discrete Mathematics
language:en
Short-container-title:APPL ANAL DISCRETE M

Author:

Diot Emilie¹,Tavenas Sébastien¹,Trotignon Nicolas¹

Affiliation:

1. Universite Lyon, CNRS, ENS de Lyon, LIP, Equipe MC, INRIA, Lyon, France

Abstract

A wheel is a graph made of a cycle of length at least 4 together with a vertex that has at least three neighbors in the cycle. We prove that the problem whose instance is a graph G and whose question is "does G contains a wheel as an induced subgraph" is NP-complete. We also settle the complexity of several similar problems. [LABEX MILYON (ANR-10-LABX-0070) of Universit? de Lyon]

Publisher

National Library of Serbia

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics,Analysis

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Detecting $$K_{2,3}$$ as an Induced Minor;Lecture Notes in Computer Science;2024

2. The (theta, wheel)-free graphs Part I: Only-prism and only-pyramid graphs;Journal of Combinatorial Theory, Series B;2020-07

3. The structure of (theta, pyramid, 1‐wheel, 3‐wheel)‐free graphs;Journal of Graph Theory;2018-10-25

4. On Strongly Chordal Graphs That Are Not Leaf Powers;Graph-Theoretic Concepts in Computer Science;2017

5. Wheel-free planar graphs;European Journal of Combinatorics;2015-10

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP