Berge trigraphs

DOI10.1002/JGT.20165MaRDI QIDQ5487777zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Maria Chudnovsky

Publication date 12 September 2006

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.20165

zbMATH Keywords

perfect graphsBerge graphshomogeneous pairs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Perfect graphs (05C17)

Recommendations

• Decomposing Berge graphs containing no proper wheel, long prism or their complements
• Decomposing Berge graphs and detecting balanced skew partitions
• The strong perfect graph theorem
• Odd pairs of cliques
• New classes of Berge perfect graphs

Cited in

(27)

• On the structure of self-complementary graphs
• Clique-stable set separation in perfect graphs with no balanced skew-partitions
• Graph partitions with prescribed patterns
• The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem
• Coloring perfect graphs with no balanced skew-partitions
• Detecting 2-joins faster
• Induced saturation number
• The structure of bull-free graphs I -- three-edge-paths with centers and anticenters
• The strong perfect graph theorem
• Graph classes and forbidden patterns on three vertices
• The P versus NP-complete dichotomy of some challenging problems in graph theory
• Perfect graphs involving semitotal and semipaired domination
• The saturation number of induced subposets of the Boolean lattice
• Decomposing Berge graphs containing no proper wheel, long prism or their complements
• On some graph classes related to perfect graphs: a survey
• Colourings, homomorphisms, and partitions of transitive digraphs
• Decomposing Berge graphs and detecting balanced skew partitions
• The sandwich problem for decompositions and almost monotone properties
• Colouring perfect graphs with bounded clique number
• Perfect graphs with no balanced skew-partition are 2-clique-colorable
• Recognizing Berge graphs
• Linear chromatic bounds for a subfamily of \(3K_{1}\)-free graphs
• The strong perfect graph conjecture: 40 years of attempts, and its resolution
• A Berge-keeping operation for graphs
• On the linear extension complexity of stable set polytopes for perfect graphs
• Combinatorial optimization with 2-joins
• Stable sets in \(\{\mathrm{ISK4,wheel}\}\)-free graphs

This page was built for publication: Berge trigraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5487777)