The following pages link to $B$-valuations of graphs (Q5659587):
Displaying 21 items.
- Representation of finite graphs as difference graphs of \(S\)-units. I (Q406579) (← links)
- Embedding a subclass of trees into hypercubes (Q534055) (← links)
- Boolean autoencoders and hypercube clustering complexity (Q690669) (← links)
- Embedding multidimensional grids into optimal hypercubes (Q740976) (← links)
- Optimal strong parity edge-coloring of complete graphs (Q1046737) (← links)
- A survey of the theory of hypercube graphs (Q1102985) (← links)
- Cover-preserving order embeddings into Boolean lattices (Q1207716) (← links)
- Boolean layer cakes (Q1285779) (← links)
- Isometric embeddings into cube-hypergraphs (Q1343777) (← links)
- Edge-colourings characterizing a class of Cayley graphs and a new characterization of hypercubes (Q1356432) (← links)
- Cover-preserving embeddings of bipartite orders into Boolean lattices (Q1392208) (← links)
- On the complexity of the embedding problem for hypercube related graphs (Q1801670) (← links)
- Parity and strong parity edge-colorings of graphs (Q1928503) (← links)
- Reconstructing \(d\)-manifold subcomplexes of cubes from their \((\lfloor d/2\rfloor+1)\)-skeletons (Q2117351) (← links)
- Avoiding and extending partial edge colorings of hypercubes (Q2122768) (← links)
- Shifting: one-inclusion mistake bounds and sample compression (Q2517823) (← links)
- A note on the cubical dimension of new classes of binary trees (Q5249653) (← links)
- Two new classes of trees embeddable into hypercubes (Q5693009) (← links)
- A class of graphs of zero Turán density in a hypercube (Q6632811) (← links)
- Layered subgraphs of the hypercube (Q6635176) (← links)
- On graphs embeddable in a layer of a hypercube and their extremal numbers (Q6644279) (← links)
