Excluding induced subgraphs: quadrilaterals

From MaRDI portal
Publication:3970902

DOI10.1002/rsa.3240020106zbMath0763.05046OpenAlexW2106491342MaRDI QIDQ3970902

Angelika Steger, Hans Jürgen Prömel

Publication date: 25 June 1992

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.3240020106




Related Items (26)

Perfect Graphs of Fixed Density: Counting and Homogeneous SetsAlmost all Berge Graphs are PerfectCounting \(r\)-graphs without forbidden configurationsThe edit distance function and symmetrizationClasses of graphs without star forests and related graphsAlmost all string graphs are intersection graphs of plane convex setsLocally bounded coverings and factorial properties of graphsThe structure of almost all graphs in a hereditary propertyStructure and enumeration theorems for hereditary properties in finite relational languagesThe Structure of Typical Eye-Free Graphs and a Turán-Type Result for Two Weighted ColoursOn the structure of graphs with low obstacle numberEmbedding Graphs into Larger Graphs: Results, Methods, and ProblemsThe maximum edit distance from hereditary graph propertiesInduced Turán NumbersForbidding induced even cycles in a graph: typical structure and countingExcluding induced subgraphs. II: Extremal graphsUnnamed ItemThe structure and the number of \(P_7\)-free bipartite graphsGraphs with Large Obstacle NumbersMeasures on monotone properties of graphsThe structure and the number of \(P_7\)-free bipartite graphsDeciding the Bell Number for Hereditary Graph PropertiesHereditary properties of hypergraphsBoundary Properties of Factorial Classes of GraphsThe speed of hereditary properties of graphsHereditary classes of graphs: a parametric approach



Cites Work


This page was built for publication: Excluding induced subgraphs: quadrilaterals