On the entropy values of hereditary classes of graphs
From MaRDI portal
Publication:4029804
DOI10.1515/DMA.1993.3.2.191zbMATH Open0797.05077OpenAlexW2038080222MaRDI QIDQ4029804FDOQ4029804
Authors: V. E. Alekseev
Publication date: 1 April 1993
Published in: Discrete Mathematics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/dma.1993.3.2.191
Recommendations
- scientific article; zbMATH DE number 1564004
- On the entropy of hereditary classes of coloured graphs
- Range of values of the entropy of hereditary classes of graphs
- On the entropy minimal hereditary classes of colored graphs
- On the structure of hereditary classes of graphs
- On the size of hereditary classes of graphs
- On entropy of graph maps that give hereditarily indecomposable inverse limits
- scientific article; zbMATH DE number 468640
- On hereditary Helly classes of graphs
- scientific article; zbMATH DE number 7410277
Cited In (32)
- The edit distance function and symmetrization
- The unlabelled speed of a hereditary graph property
- The micro-world of cographs
- Supersaturation for hereditary properties
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Classes of graphs without star forests and related graphs
- Hereditary classes of graphs: a parametric approach
- The structure of almost all graphs in a hereditary property
- The structure of hereditary properties and 2-coloured multigraphs
- The maximum edit distance from hereditary graph properties
- The number of graphs with large forbidden subgraphs
- Structured Codes of Graphs
- The structure of typical eye-free graphs and a Turán-type result for two weighted colours
- Hereditary properties of hypergraphs
- Shadows of ordered graphs
- The structure and the number of \(P_7\)-free bipartite graphs
- The structure and the number of \(P_7\)-free bipartite graphs
- On the problem of domino recognition
- A jump to the Narayana number for hereditary properties of ordered 3-uniform hypergraphs
- Forbidden induced partial orders
- Implicit representation of sparse hereditary families
- What Graphs are 2-Dot Product Graphs?
- Title not available (Why is that?)
- Almost all string graphs are intersection graphs of plane convex sets
- Hereditary properties of partitions, ordered graphs and ordered hypergraphs
- Measures on monotone properties of graphs
- Induced \(C_5\)-free graphs of fixed density: counting and homogeneous sets
- The speed of hereditary properties of graphs
- A remark on the number of edge colorings of graphs
- Almost all string graphs are intersection graphs of plane convex sets
- On estimation of the number of graphs in some hereditary classes
- Perfect graphs of fixed density: counting and homogeneous sets
This page was built for publication: On the entropy values of hereditary classes of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4029804)