The problem of determining the Helly dimension of a graph

MaRDI QIDQ2912981zbMATH OpenFDO

Authors Evgenii Vyacheslavovich Krylov

Publication date 25 September 2012

Published in Vestnik Belorusskogo Gosudarstvennogo Universiteta. Seria 1. Fizika, Matematika, Informatika (Search for Journal in Brave)

zbMATH Keywords

degree sequencedomishold graphHelly dimensionmaximal cliques

Mathematics Subject Classification ID

Vertex degrees (05C07) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Helly dimension of line graphs of k-uniform hypergraphs
• The Helly property on subfamilies of limited size
• Complexity aspects of the Helly property: graphs and hypergraphs
• scientific article; zbMATH DE number 468643
• On the strong \(p\)-Helly property

Cited in

(4)

• Beyond Helly graphs: the diameter problem on absolute retracts
• Distance problems within Helly graphs and \(k\)-Helly graphs
• Helly dimension of line graphs of k-uniform hypergraphs
• scientific article; zbMATH DE number 468643 (Why is no real title available?)

This page was built for publication: The problem of determining the Helly dimension of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2912981)