Subgraphs of hypercubes and subdiagrams of Boolean lattices (Q1815849): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On cubical graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A survey of the theory of hypercube graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Cover-preserving embeddings of bipartite orders into Boolean lattices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Embedding Trees in a Hypercube is NP-Complete / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Cover-preserving order embeddings into Boolean lattices / rank | |||
Normal rank | |||
Latest revision as of 14:45, 24 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Subgraphs of hypercubes and subdiagrams of Boolean lattices |
scientific article |
Statements
Subgraphs of hypercubes and subdiagrams of Boolean lattices (English)
0 references
17 June 1997
0 references
We extensively treat the following problems: When is a given graph a subgraph (resp. induced subgraph) of a hypercube and when is an ordered set a subdiagram (resp. induced subdiagram) of a Boolean lattice? We present characterizations for that in terms of suitable edge-colorings of the graphs and, for ordered sets, of their covering graphs.
0 references
embedding
0 references
edge-coloring
0 references
induced subgraph
0 references
hypercube
0 references
ordered set
0 references
induced subdiagram
0 references
Boolean lattice
0 references
covering graphs
0 references
