scientific article; zbMATH DE number 1099508
From MaRDI portal
Publication:4369478
Recommendations
Cited in
(21)- A counter-example to the probabilistic universal graph conjecture via randomized communication complexity
- Hereditary classes of graphs: a parametric approach
- Stable-\(\Pi\) partitions of graphs
- On estimation of the number of graphs in some hereditary classes
- Range of values of the entropy of hereditary classes of graphs
- Locally bounded coverings and factorial properties of graphs
- On factorial properties of chordal bipartite graphs
- On the entropy of hereditary classes of coloured graphs
- scientific article; zbMATH DE number 1564004 (Why is no real title available?)
- Implicit representations and factorial properties of graphs
- Boundary properties of factorial classes of graphs
- Boundary properties of graphs for algorithmic graph problems
- Deciding the Bell number for hereditary graph properties
- Between 2- and 3-colorability
- The structure and the number of \(P_7\)-free bipartite graphs
- The structure and the number of \(P_7\)-free bipartite graphs
- Small but unwieldy: a lower bound on adjacency labels for small classes
- A polynomial Ramsey statement for bounded VC-dimension
- Tight bounds on adjacency labels for monotone graph classes
- Typical structure of hereditary graph families. I: Apex-free families
- Recent developments on graphs of bounded clique-width
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4369478)
