Square-free perfect graphs.
From MaRDI portal
Publication:1426100
DOI10.1016/j.jctb.2003.08.003zbMath1033.05047OpenAlexW2016617305WikidataQ57949594 ScholiaQ57949594MaRDI QIDQ1426100
Kristina Vušković, Michele Conforti, Cornuéjols, Gérard
Publication date: 14 March 2004
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: http://eprints.whiterose.ac.uk/74358/2/squarefree.pdf
Related Items
Counting Homomorphisms to Square-Free Graphs, Modulo 2, Detecting 2-joins faster, Even pairs in square-free Berge graphs, Classes of perfect graphs, Decomposing Berge graphs and detecting balanced skew partitions, On cover-structure graphs, Basic perfect graphs and their extensions, Combinatorial optimization with 2-joins, The strong perfect graph conjecture: 40 years of attempts, and its resolution
Cites Work
- The strong perfect graph theorem
- Coloring perfect \((K_ 4\)-e)-free graphs
- Paw-free graphs
- Star-cutsets and perfect graphs
- Some properties of minimal imperfect graphs
- Alpha-balanced graphs and matrices and GF(3)-representability of matroids
- Structural properties and decomposition of linear balanced matrices
- Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets
- Articulation sets in linear perfect matrices. II: The wheel theorem and clique articulations
- The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
- Critical perfect graphs and perfect 3-chromatic graphs
- On the perfect graph conjecture
- On a class of square-free graphs
- Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs
- Decomposition of balanced matrices
- A theorem of Truemper
- Balanced \(0,\pm 1\) matrices. I: Decomposition
- Balanced \(0,\pm 1\) matrices. II: Recognition algorithm
- Compositions for perfect graphs
- On a property of the class of n-colorable graphs
- Combinatorial Optimization
- Even-hole-free graphs part I: Decomposition theorem
- Recognizing Dart-Free Perfect Graphs
- A mickey-mouse decomposition theorem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
