On the size of hereditary classes of graphs

From MaRDI portal
Publication:1328380

DOI10.1006/jctb.1994.1027zbMath0811.05048OpenAlexW2081735788MaRDI QIDQ1328380

Edward R. Scheinerman, Jennifer S. Zito

Publication date: 29 August 1994

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1994.1027




Related Items (36)

On the Tutte and Matching Polynomials for Complete GraphsHereditary properties of partitions, ordered graphs and ordered hypergraphsJumps in speeds of hereditary properties in finite relational languagesGraph reconstruction in the congested cliqueClasses of graphs without star forests and related graphsOn estimation of the number of graphs in some hereditary classesLocally bounded coverings and factorial properties of graphsA jump to the Narayana number for hereditary properties of ordered 3-uniform hypergraphsShadows of ordered graphsStructure and enumeration theorems for hereditary properties in finite relational languagesOn factorial properties of chordal bipartite graphsImplicit representations and factorial properties of graphsOn the speed of algebraically defined graph classesThe maximum edit distance from hereditary graph propertiesBetween 2- and 3-colorabilityRecent developments on graphs of bounded clique-widthThe penultimate rate of growth for graph propertiesDefinability of Combinatorial Functions and Their Linear Recurrence RelationsBoundary properties of graphs for algorithmic graph problemsGrowth constants of minor-closed classes of graphsThe structure and the number of \(P_7\)-free bipartite graphsMeasures on monotone properties of graphsThe structure and the number of \(P_7\)-free bipartite graphsDeciding the Bell Number for Hereditary Graph PropertiesExcluding induced subgraphs: Critical graphsHereditary properties of hypergraphsThe unlabelled speed of a hereditary graph propertyOn list \(k\)-coloring convex bipartite graphsBoundary Properties of Factorial Classes of GraphsThe number of graphs without forbidden subgraphsChordal bipartite graphs of bounded tree- and clique-widthA jump to the Bell number for hereditary graph propertiesEfficient Local Representations of GraphsLocal representations using very short labelsThe speed of hereditary properties of graphsHereditary classes of graphs: a parametric approach




This page was built for publication: On the size of hereditary classes of graphs