Cover-preserving embeddings of bipartite orders into Boolean lattices

DOI10.1016/S0304-3975(96)00207-1zbMath0896.06004OpenAlexW2006447265MaRDI QIDQ1392208

Klaus Reuter, Jutta Mitas

Publication date: 23 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(96)00207-1

zbMATH Keywords

edge-coloringBoolean latticeembeddabilitycrownscovering graphbipartite networkshypercube networksparallel computer architecturesbipartite ordered setscycle-free orders

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Coloring of graphs and hypergraphs (05C15) Mathematical problems of computer architecture (68M07)

Related Items (2)

Subgraphs of hypercubes and subdiagrams of Boolean lattices ⋮ Boolean layer cakes

Cites Work

• Unnamed Item
• Fixed hypercube embedding
• Cover-preserving order embeddings into Boolean lattices
• Distance-preserving subgraphs of hypercubes
• $B$-valuations of graphs

This page was built for publication: Cover-preserving embeddings of bipartite orders into Boolean lattices