The following pages link to (Q5688999):
Displaying 50 items.
- New results on word-representable graphs (Q344843) (← links)
- The edit distance function and symmetrization (Q396842) (← links)
- Locally bounded coverings and factorial properties of graphs (Q412246) (← links)
- Tournaments with near-linear transitive subsets (Q462934) (← links)
- The structure of almost all graphs in a hereditary property (Q631643) (← links)
- The structure of hereditary properties and 2-coloured multigraphs (Q653987) (← links)
- On the structure of graphs with low obstacle number (Q659699) (← links)
- The number of graphs with large forbidden subgraphs (Q710718) (← links)
- On the subgraph epimorphism problem (Q741740) (← links)
- Hereditary properties of partitions, ordered graphs and ordered hypergraphs (Q850077) (← links)
- Graph limits and hereditary properties (Q896080) (← links)
- The maximum edit distance from hereditary graph properties (Q933672) (← links)
- Hereditary properties of hypergraphs (Q1003850) (← links)
- Hereditary properties of graphs: Asymptotic enumeration, global structure, and colouring (Q1126826) (← links)
- Recognizing global occurrence of local properties (Q1296525) (← links)
- Forbidden induced partial orders (Q1301728) (← links)
- On the size of hereditary classes of graphs (Q1328380) (← links)
- Structure and enumeration theorems for hereditary properties in finite relational languages (Q1706268) (← links)
- Forbidding induced even cycles in a graph: typical structure and counting (Q1748271) (← links)
- The number of graphs without forbidden subgraphs (Q1826950) (← links)
- The speed of hereditary properties of graphs (Q1850473) (← links)
- The number of 2-SAT functions (Q1870908) (← links)
- Minimal reducible bounds for induced-hereditary properties (Q1883266) (← links)
- Theoretical aspects of equitable partition of networks into sparse modules (Q2031046) (← links)
- Hereditary classes of graphs: a parametric approach (Q2104934) (← links)
- Accumulation points of the edit distance function (Q2138953) (← links)
- Counting \(r\)-graphs without forbidden configurations (Q2171019) (← links)
- Almost all string graphs are intersection graphs of plane convex sets (Q2189736) (← links)
- \((k,l)\)-colourings and Ferrers diagram representations of cographs (Q2225413) (← links)
- Robustness: a new form of heredity motivated by dynamic networks (Q2285145) (← links)
- Forcing large transitive subtournaments (Q2343283) (← links)
- EH-suprema of tournaments with no nontrivial homogeneous sets (Q2349509) (← links)
- A remark on the number of edge colorings of graphs (Q2368713) (← links)
- The unlabelled speed of a hereditary graph property (Q2519010) (← links)
- A jump to the Bell number for hereditary graph properties (Q2565685) (← links)
- LP-based dual bounds for the maximum quasi-clique problem (Q2664003) (← links)
- Jumps in speeds of hereditary properties in finite relational languages (Q2668015) (← links)
- Hereditary classes of line graphs (Q2715948) (← links)
- A note on counting orientations (Q2840675) (← links)
- Induced \(C_5\)-free graphs of fixed density: counting and homogeneous sets (Q2857341) (← links)
- Perfect graphs of fixed density: counting and homogeneous sets (Q2911067) (← links)
- Graphs with Large Obstacle Numbers (Q3057633) (← links)
- On estimation of the number of graphs in some hereditary classes (Q3225907) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Conditional graph connectivity relative to hereditary properties (Q3348005) (← links)
- Stability‐type results for hereditary properties (Q3652542) (← links)
- Maximal graphs with respect to hereditary properties (Q4209932) (← links)
- On some variations of extremal graph problems (Q4209933) (← links)
- Adjacency Labeling Schemes and Induced-Universal Graphs (Q4610450) (← links)
- 𝑉𝐶_{ℓ}-dimension and the jump to the fastest speed of a hereditary ℒ-property (Q4636765) (← links)
