scientific article; zbMATH DE number 3825706

MaRDI QIDQ3671883zbMATH OpenFDO

Authors V. E. Alekseev

Publication date 1982

zbMATH Keywords

graph encodinghereditary graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Source coding (94A29)

Cited in

(12)

• On easy and hard hereditary classes of graphs with respect to the independent set problem
• Structure and enumeration theorems for hereditary properties in finite relational languages
• Largest sparse subgraphs of random graphs
• Jumps in speeds of hereditary properties in finite relational languages
• New results on word-representable graphs
• Supersaturation for hereditary properties
• Locally bounded coverings and factorial properties of graphs
• \(\mathrm{VC}_{\ell }\)-dimension and the jump to the fastest speed of a hereditary \(\mathcal {L}\)-property
• Boundary properties of factorial classes of graphs
• On the König graphs for a 5-path and its spanning supergraphs
• On the edit distance function of the random graph
• 3-quasiperiodic functions on graphs and hypergraphs

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 Q3671883)