Adjacency labeling schemes for small classes
From MaRDI portal
Cites work
- A Census of Planar Triangulations
- Adjacency Labelling for Planar Graphs (and Beyond)
- An adjacency labeling scheme based on a decomposition of trees into caterpillars
- Applications of a new separator theorem for string graphs
- Central limit theorems for empirical measures
- Characterising bounded expansion by neighbourhood complexity
- Clique-width and the speed of hereditary properties
- Counting Interval Graphs
- Efficient graph representations
- Geometric discrepancy. An illustrated guide
- Graph parameters, implicit representations and factorial properties
- Graph theory. Favorite conjectures and open problems -- 1
- Graphs without large bicliques and well-quasi-orderability by the induced subgraph relation
- scientific article; zbMATH DE number 1696534 (Why is no real title available?)
- Implicat Representation of Graphs
- Implicit representation of sparse hereditary families
- Incidence matrices and interval graphs
- Induced subdivisions and bounded expansion
- Induced subdivisions in \(K_{s,s}\)-free graphs of large average degree
- Neighborhood complexity and kernelization for nowhere dense classes of graphs
- Neighbourhood complexity of graphs of bounded twin-width
- On a problem of K. Zarankiewicz
- Optimal induced universal graphs and adjacency labeling for trees
- Proper minor-closed families are small
- Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs
- Small but unwieldy: a lower bound on adjacency labels for small classes
- Small graph classes and bounded expansion
- Sparsity. Graphs, structures, and algorithms
- Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
- Strongly sublinear separators and polynomial expansion
- Symmetric-difference (degeneracy) and signed tree models
- Testing first-order properties for subclasses of sparse graphs
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The implicit graph conjecture is false
- The number of labeled k-dimensional trees
- The number of trees
- Tight bounds on adjacency labels for monotone graph classes
- Twin-width and polynomial kernels
- Twin-width II: small classes
- Upper bounds on the automorphism group of a graph
This page was built for publication: Adjacency labeling schemes for small classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7296653)
