Square-free perfect graphs

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, University of Aix-Marseille, 163 Av. de Luminy, Marseille, France;School of Computing, University of Leeds, Leeds LS2 9JT, UK
Venue:
Journal of Combinatorial Theory Series B
Year:
2004

Citing 14
Cited 5

Coloring perfect (K4-e)-free graphs

Journal of Combinatorial Theory Series B
Paw-fee graphs

Information Processing Letters
Articulation sets in linear perfect matrices I: forbidden configurations and star cutsets

Discrete Mathematics
Structural properties and decomposition of linear balanced matrices

Mathematical Programming: Series A and B
Articulation sets in linear perfect matrices II: the wheel theorem and clique articulations

Discrete Mathematics
On a class of square-free graphs

Information Processing Letters
Some properties of minimal imperfect graphs

Discrete Mathematics
Decomposition of balanced matrices

Journal of Combinatorial Theory Series B
Balanced 0, ±1 matrices I. decomposition

Journal of Combinatorial Theory Series B
Balanced 0, ±1 matrices II. recognition algorithm

Journal of Combinatorial Theory Series B
Recognizing Dart-Free Perfect Graphs

SIAM Journal on Computing
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
Even-hole-free graphs part I: Decomposition theorem

Journal of Graph Theory

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

Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
Decomposing Berge graphs and detecting balanced skew partitions

Journal of Combinatorial Theory Series B
On cover-structure graphs

Discrete Applied Mathematics
Combinatorial optimization with 2-joins

Journal of Combinatorial Theory Series B
Detecting 2-joins faster

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove that square-free perfect graphs are bipartite graphs or line graphs of bipartite graphs or have a 2-join or a star cutset.