$B$-valuations of graphs
From MaRDI portal
Publication:5659587
DOI10.21136/cmj.1972.101102zbMath0247.05148OpenAlexW183327403MaRDI QIDQ5659587
Jaroslav Morávek, Ivan M. Havel
Publication date: 1972
Full work available at URL: https://eudml.org/doc/12662
Extremal problems in graph theory (05C35) Formal languages and automata (68Q45) Graph theory (05C99)
Related Items
Avoiding and extending partial edge colorings of hypercubes, Isometric embeddings into cube-hypergraphs, Edge-colourings characterizing a class of Cayley graphs and a new characterization of hypercubes, A survey of the theory of hypercube graphs, Parity and strong parity edge-colorings of graphs, Cover-preserving embeddings of bipartite orders into Boolean lattices, Representation of finite graphs as difference graphs of \(S\)-units. I, Two new classes of trees embeddable into hypercubes, Boolean autoencoders and hypercube clustering complexity, Embedding a subclass of trees into hypercubes, Cover-preserving order embeddings into Boolean lattices, Shifting: one-inclusion mistake bounds and sample compression, On the complexity of the embedding problem for hypercube related graphs, Embedding multidimensional grids into optimal hypercubes, Boolean layer cakes, Optimal strong parity edge-coloring of complete graphs, A note on the cubical dimension of new classes of binary trees, Reconstructing \(d\)-manifold subcomplexes of cubes from their \((\lfloor d/2\rfloor+1)\)-skeletons
Cites Work
