B-valuations of graphs
From MaRDI portal
Cited in
(22)- Optimal strong parity edge-coloring of complete graphs
- A survey of the theory of hypercube graphs
- Cover-preserving order embeddings into Boolean lattices
- Boolean layer cakes
- Isometric embeddings into cube-hypergraphs
- Edge-colourings characterizing a class of Cayley graphs and a new characterization of hypercubes
- Cover-preserving embeddings of bipartite orders into Boolean lattices
- On the complexity of the embedding problem for hypercube related graphs
- Parity and strong parity edge-colorings of graphs
- Reconstructing \(d\)-manifold subcomplexes of cubes from their \((\lfloor d/2\rfloor+1)\)-skeletons
- Avoiding and extending partial edge colorings of hypercubes
- Shifting: one-inclusion mistake bounds and sample compression
- Representation of finite graphs as difference graphs of S-units. I
- A note on the cubical dimension of new classes of binary trees.
- Embedding a subclass of trees into hypercubes
- Two new classes of trees embeddable into hypercubes
- A class of graphs of zero Turán density in a hypercube
- Layered subgraphs of the hypercube
- On graphs embeddable in a layer of a hypercube and their extremal numbers
- Boolean autoencoders and hypercube clustering complexity
- Strong parity edge-colorings of graphs
- Embedding multidimensional grids into optimal hypercubes
This page was built for publication: B-valuations of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5659587)
