Chordless paths through three vertices
type: Item
instance of: scholarly article
title: Chordless paths through three vertices
zbMATH Open document ID: 1086.68102
author: N. E. Zubov
published in: Theoretical Computer Science
publication date: 2006-04-06T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5017473
zbMATH Keywords: graph theory
zbMATH Keywords: induced path
zbMATH Keywords: parameterized complexity
MaRDI profile type: Publication
full work available at URL: j.tcs.2005.10.021
OpenAlex ID: W2144784192
cites work: On the complexity of testing for odd holes and induced odd paths
cites work: Corrigendum to: On the complexity of testing for odd holes and induced odd paths
cites work: On the parameterized complexity of short computation and factorization
cites work: Perfect Code is \(W[1]\)-complete
cites work: The Turing way to parameterized complexity
cites work: On the efficiency of polynomial time approximation schemes
cites work: The strong perfect graph theorem
cites work: Fixed-parameter tractability and completeness II: On completeness for W[1]
cites work: Q4393480
cites work: Q4501141
cites work: Q3034816
cites work: The complexity of induced minors and related problems
cites work: Maximal Flow Through a Network
cites work: The directed subgraph homeomorphism problem
cites work: Q4198056
cites work: Q4441723
cites work: On the Computational Complexity of Combinatorial Problems
cites work: Algorithmic Aspects of Vertex Elimination on Graphs
cites work: Non-interfering network flows
cites work: Induced circuits in planar graphs
cites work: Q5710169
cites work: Q5501347
cites work: Graph minors. XIII: The disjoint paths problem
cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
DOI: 10.1016/J.TCS.2005.10.021
description: scientific article; zbMATH DE number 5017473