On the dimension of trees

DOI10.1016/0012-365X(81)90064-9MaRDI QIDQ5904988zbMATH OpenFDO

Authors Svatopluk Poljak, A. Pultr

Publication date 1981

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(81)90064-9

zbMATH Keywords

bipartite dimensiondimension of a graphforest

Mathematics Subject Classification ID

Trees (05C05) Graph theory (05C99)

Cites work

• A simple proof of the Galvin-Ramsey property of the class of all finite graphs and a dimension of a graph
• Complexity of dimension three and some related edge-covering characteristics of graphs
• scientific article; zbMATH DE number 3747197 (Why is no real title available?)
• scientific article; zbMATH DE number 3563183 (Why is no real title available?)
• scientific article; zbMATH DE number 3608054 (Why is no real title available?)
• On a product dimension of bipartite graphs
• On a product dimension of graphs

Cited in

(4)

• The Johnson-Lindenstrauss lemma and the sphericity of some graphs
• scientific article; zbMATH DE number 4047780 (Why is no real title available?)
• Product dimension of forests and bounded treewidth graphs
• Note on strong product graph dimension

This page was built for publication: On the dimension of trees

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