Journal of Combinatorial Theory Series B
Decomposition of odd-hole-free graphs by double star cutsets and 2-joins
Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
A polynomial recognition algorithm for balanced matrices
Journal of Combinatorial Theory Series B
Bisimplicial vertices in even-hole-free graphs
Journal of Combinatorial Theory Series B
Algorithms for finding an induced cycle in planar graphs and bounded genus graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences
Journal of Combinatorial Theory Series B
Induced Packing of Odd Cycles in a Planar Graph
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
The induced disjoint paths problem
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Graphs of separability at most two: structural characterizations and their consequences
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Combinatorial optimization with 2-joins
Journal of Combinatorial Theory Series B
A faster algorithm to recognize even-hole-free graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Induced packing of odd cycles in planar graphs
Theoretical Computer Science
Graphs of separability at most 2
Discrete Applied Mathematics
Complexity of independent set reconfigurability problems
Theoretical Computer Science
Decomposition of even-hole-free graphs with star cutsets and 2-joins
Journal of Combinatorial Theory Series B
Journal of Discrete Algorithms
Hi-index | 0.00 |
We prove a decomposition theorem for even-hole-free graphs. The decompositions used are 2-joins and star, double-star and triple-star cutsets. This theorem is used in the second part of this paper to obtain a polytime recognition algorithm for even-hole-free graphs. © 2002 John Wiley & Sons, Inc. J Graph Theory 39: 6–49, 2002 Part of the research was completed while Kristina Vušković was at the Department of Combinatorics and Optimization, University of Waterloo on an NSERC Canada International Fellowship.