Almost all Berge Graphs are Perfect
From MaRDI portal
Publication:4291185
DOI10.1017/S0963548300000079zbMath0793.05063MaRDI QIDQ4291185
Hans Jürgen Prömel, Angelika Steger
Publication date: 30 May 1994
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548300000079
Related Items
Random perfect graphs, Almost all string graphs are intersection graphs of plane convex sets, Perfectly contractile graphs and quadratic toric rings, The structure of almost all graphs in a hereditary property, Algorithms for unipolar and generalized split graphs, Perfectly orderable graphs and almost all perfect graphs are kernel \(M\)- solvable, The normal graph conjecture for two classes of sparse graphs, Recognition of unipolar and generalised split graphs, Forbidding induced even cycles in a graph: typical structure and counting, The first order convergence law fails for random perfect graphs, The number of 2-SAT functions, Almost all string graphs are intersection graphs of plane convex sets, Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3, Unnamed Item, Perfect Graphs with No Balanced Skew-Partition are 2-Clique-Colorable, Perfect Graphs of Fixed Density: Counting and Homogeneous Sets, For most graphs H , most H -free graphs have a linear homogeneous set, Excluding induced subgraphs: Critical graphs, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Stability‐type results for hereditary properties
Cites Work
