Hereditary classes of graphs: a parametric approach
From MaRDI portal
Publication:2104934
DOI10.1016/j.dam.2022.10.016zbMath1504.05241OpenAlexW4308743611MaRDI QIDQ2104934
Publication date: 8 December 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2022.10.016
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extending the Gyárfás-Sumner conjecture
- The structure of almost all graphs in a hereditary property
- On partial well-order for monotone grid classes of permutations
- Excluding induced subgraphs. II: Extremal graphs
- Graph minors. XX: Wagner's conjecture
- On low tree-depth decompositions
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
- Graph minors. V. Excluding a planar graph
- On the size of hereditary classes of graphs
- Letter graphs and well-quasi-order by induced subgraphs
- On easy and hard hereditary classes of graphs with respect to the independent set problem
- Graph parameters and Ramsey theory
- Algorithmic meta-theorems for restrictions of treewidth
- The speed of hereditary properties of graphs
- Threshold graphs and related topics
- Tree-width dichotomy
- Graph parameters, implicit representations and factorial properties
- Two forbidden induced subgraphs and well-quasi-ordering
- Dominating sets in \(k\)-majority tournaments.
- A jump to the Bell number for hereditary graph properties
- Classes of graphs without star forests and related graphs
- Geometric grid classes of permutations
- Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths
- The h-Index of a Graph and its Application to Dynamic Subgraph Statistics
- K l+1 -Free Graphs: Asymptotic Structure and a 0-1 Law
- Excluding induced subgraphs: quadrilaterals
- Excluding Induced Subgraphs III: A General Asymptotic
- On the entropy values of hereditary classes of graphs
- Radius two trees specify χ‐bounded classes
- On Universal Threshold Graphs
- Radius Three Trees in Graphs with Large Chromatic Number
- Projections of Bodies and Hereditary Properties of Hypergraphs
- Well‐quasi‐ordering and finite distinguishing number
- An interval graph is not a comparability graph
- An interval graph is a comparability graph
- A Combinatorial Theorem
- Deciding the Bell Number for Hereditary Graph Properties
- Letter graphs and geometric grid classes of permutations: characterization and recognition
This page was built for publication: Hereditary classes of graphs: a parametric approach
