Finding odd cycle transversals

2004/01/22 by Bruce Reed, Kaleigh Smith, Adrian Vetta · 10 citations
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Combinatorics #Discrete mathematics #Graph #Graph Labeling and Dimension Problems #Mathematical analysis #Mathematics #Transversal (combinatorics) #graph theory and CDMA systems

paper · doi:10.1016/j.orl.2003.10.009

openalex publication_date 2004/01/22 · crossref created 2004/01/22 · crossref issued 2004/07/01 · crossref published 2004/07/01 · crossref published-print 2004/07/01 · crossref deposited 2019/02/15 · openalex created_date 2025/10/10 · crossref indexed 2026/03/07 · openalex updated_date 2026/05/05

Citations

• Reducibility among Combinatorial Problems

Cited by

• Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
• The Graph Minor Algorithm with Parity Conditions
• Interval Completion Is Fixed Parameter Tractable
• Kernelization: Theory of Parameterized Preprocessing
• On Feedback Vertex Set New Measure and New Structures
• A fixed-parameter algorithm for the directed feedback vertex set problem
• Improved algorithms for feedback vertex set problems
• Parameterized vertex deletion problems for hereditary graph classes with\n a block property
• Fast FPT-approximation of branchwidth
• Bipartite graph [wikipedia]