Decomposition of odd-hole-free graphs by double star cutsets and 2-joins

Authors:
Michele Conforti;Gérard Cornuéjols;Kristina Vuŝković
Affiliations:
Dipartimento di Matematica Pura ed Applicata, Università di Padova, Via Belzoni 7, 35131 Padova, Italy;GSIA, Carnegie Mellon University, Schenley Park, Pittsburgh. PA and LIF, Université de Marseille, 163 Av de Luminy, 13288 Marseille, France;School of Computing, University of Leeds, Leeds LS2 9JT, UK
Venue:
Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
Year:
2004

Citing 5
Cited 7

A Mickey-Mouse Decomposition Theorem

Proceedings of the 4th International IPCO Conference on Integer Programming and Combinatorial Optimization
Graphs without odd holes, parachutes or proper wheels: a generalization of Meyniel graphs and of line graphs of bipartite graphs

Journal of Combinatorial Theory Series B
Square-free perfect graphs

Journal of Combinatorial Theory Series B
Even-hole-free graphs part I: Decomposition theorem

Journal of Graph Theory
Even-hole-free graphs part II: Recognition algorithm

Journal of Graph Theory

A polynomial recognition algorithm for balanced matrices

Journal of Combinatorial Theory Series B
Decomposing Berge graphs and detecting balanced skew partitions

Journal of Combinatorial Theory Series B
Combinatorial optimization with 2-joins

Journal of Combinatorial Theory Series B
Graphs of separability at most 2

Discrete Applied Mathematics
Decomposition of even-hole-free graphs with star cutsets and 2-joins

Journal of Combinatorial Theory Series B
Detecting 2-joins faster

Journal of Discrete Algorithms
Substitution and Χ-boundedness

Journal of Combinatorial Theory Series B

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we decompose odd-hole-free graphs (graphs that do not contain as an induced subgraph a chordless cycle of odd length greater than three) with double star cutsets and 2-joins into bipartite graphs, line graphs of bipartite graphs and the complements of line graphs of bipartite graphs.