Lattice embeddings of trees
From MaRDI portal
Publication:1024313
DOI10.1016/J.EJC.2008.09.016zbMATH Open1218.05107OpenAlexW2084047905MaRDI QIDQ1024313FDOQ1024313
Publication date: 17 June 2009
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2008.09.016
Recommendations
Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Title not available (Why is that?)
- Media theory. Interdisciplinary applied mathematics.
- Distance-preserving subgraphs of hypercubes
- Embeddability of the combinohedron
- Title not available (Why is that?)
- Embedding into rectilinear spaces
- The lattice dimension of a graph
- Title not available (Why is that?)
- The lattice dimension of benzenoid systems
- Title not available (Why is that?)
- On semicube graphs
- Title not available (Why is that?)
Cited In (12)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The fiber dimension of a graph
- Historical lattice trees
- A poset-based approach to embedding median graphs in hypercubes and lattices
- Vector lattices and rooted trees
- Embeddings of binary trees in lines
- Embedding meshes of trees into deBruijn graphs
- A lattice on decreasing trees: the metasylvester lattice
- Bipartite embeddings of trees in the plane
- Embedding trees in recursive circulants
- Perfect trees and elementary embeddings
This page was built for publication: Lattice embeddings of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024313)