Hereditary classes of graphs: a parametric approach
type: Item
instance of: scholarly article
title: Hereditary classes of graphs: a parametric approach
zbMATH Open document ID: 1504.05241
author: Vadim Lozin
published in: Discrete Applied Mathematics
publication date: 2022-12-08T00:00:00Z
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 05D10
zbMATH DE Number: 7628644
zbMATH Keywords: hereditary class
zbMATH Keywords: graph parameter
zbMATH Keywords: Ramsey theory
MaRDI profile type: Publication
full work available at URL: j.dam.2022.10.016
OpenAlex ID: W4308743611
cites work: Geometric grid classes of permutations
cites work: Graph parameters, implicit representations and factorial properties
cites work: Letter graphs and geometric grid classes of permutations: characterization and recognition
cites work: On the entropy values of hereditary classes of graphs
cites work: Q4369478
cites work: On easy and hard hereditary classes of graphs with respect to the independent set problem
cites work: The structure of almost all graphs in a hereditary property
cites work: Dominating sets in \(k\)-majority tournaments.
cites work: Classes of graphs without star forests and related graphs
cites work: Well‐quasi‐ordering and finite distinguishing number
cites work: Deciding the Bell number for hereditary graph properties
cites work: Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths
cites work: The speed of hereditary properties of graphs
cites work: A jump to the Bell number for hereditary graph properties
cites work: Projections of Bodies and Hereditary Properties of Hypergraphs
cites work: Q5688999
cites work: Extending the Gyárfás-Sumner conjecture
cites work: Q4165164
cites work: The h-Index of a Graph and its Application to Dynamic Subgraph Statistics
cites work: The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
cites work: A Combinatorial Theorem
cites work: Q4133658
cites work: An interval graph is not a comparability graph
cites work: On Universal Threshold Graphs
cites work: An interval graph is a comparability graph
cites work: Radius two trees specify χ‐bounded classes
cites work: Radius Three Trees in Graphs with Large Chromatic Number
cites work: K l+1 -Free Graphs: Asymptotic Structure and a 0-1 Law
cites work: Two forbidden induced subgraphs and well-quasi-ordering
cites work: Algorithmic meta-theorems for restrictions of treewidth
cites work: Graph parameters and Ramsey theory
cites work: Tree-width dichotomy
cites work: Q3568753
cites work: Threshold graphs and related topics
cites work: On low tree-depth decompositions
cites work: Letter graphs and well-quasi-order by induced subgraphs
cites work: Excluding induced subgraphs: quadrilaterals
cites work: Excluding Induced Subgraphs III: A General Asymptotic
cites work: Excluding induced subgraphs. II: Extremal graphs
cites work: Graph minors. V. Excluding a planar graph
cites work: Graph minors. XX: Wagner's conjecture
cites work: On the size of hereditary classes of graphs
cites work: On partial well-order for monotone grid classes of permutations
DOI: 10.1016/J.DAM.2022.10.016
Recommended article: On the structure of hereditary classes of graphs
Recommended article: Q5387731
Recommended article: On the size of hereditary classes of graphs
Recommended article: Critical hereditary graph classes: a survey
Recommended article: Q4272117
Recommended article: Towards an isomorphism dichotomy for hereditary graph classes
Recommended article: Towards an Isomorphism Dichotomy for Hereditary Graph Classes
Recommended article: A survey of hereditary properties of graphs
Recommended article: The world of hereditary graph classes viewed through Truemper configurations
Recommended article: Hereditary classes of line graphs
description: scientific article; zbMATH DE number 7628644