Recommendations
Cites work
- scientific article; zbMATH DE number 3833876 (Why is no real title available?)
- scientific article; zbMATH DE number 3154393 (Why is no real title available?)
- scientific article; zbMATH DE number 3765843 (Why is no real title available?)
- scientific article; zbMATH DE number 3336710 (Why is no real title available?)
- scientific article; zbMATH DE number 3395950 (Why is no real title available?)
- B-valuations of graphs
- A Graph Model for Fault-Tolerant Computing Systems
- A characterization of hypercubes
- A characterization of the n-cube by convex subgraphs
- A lower bound for crossing numbers of graphs with application to \(K_n\),\(K_{pq}\)g, and \(Q(d)\)
- Acquaintance Graph Party Problem
- Another characterization of hypercubes
- Bounds on the Coarseness of the n-Cube
- Bounds on the number of Hamiltonian circuits in the n-cube
- Convexity in graphs
- Cospectral Graphs and Digraphs
- Die dicke des n-dimensionalen Würfel-graphen
- Embedding the dichotomic tree into the n-cube
- Embedding the polytomic tree into the n-cube
- Maximum versus minimum invariants for graphs
- On Hamiltonian circuits and spanning trees of hypercubes
- On Homeomorphic Embeddings of Km,n in the Cube
- On cubes and dichotomic trees
- On cubical graphs
- On quasistars in n-cubes
- On the Number of Hamiltonian Circuits in the n-Cube
- On the Stable Crossing Number of Cubes
- One-legged caterpillars span hypercubes
- Parallel concepts in graph theory
- Proof of the squashed cube conjecture
- Smallest maximal matchings in the graph of the d-dimensional cube
- The Genus of the n-Cube
- The starlike trees which span a hypercube
- Towards a theory of domination in graphs
- Über drei kombinatorische Probleme am \(n\)-dimensionalen Würfel und Würfelgitter
Cited in
(only showing first 100 items - show all)- Embedding of hypercube into fractal cubic network
- About the uniqueness of the minimal 1-edge extension of a hypercube
- Subgraphs of hypercubes and subdiagrams of Boolean lattices
- Invariants of E-graphs
- On the g-extra diagnosability of enhanced hypercubes
- Using maximality and minimality conditions to construct inequality chains
- Towards integrable structure in 3d Ising model
- Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs
- Analysis of discrete bioregulatory networks using symbolic steady states
- Structure fault tolerance of hypercubes and folded hypercubes
- On completely edge-independent spanning trees in locally twisted cubes
- Some results on topological properties of folded hypercubes
- From data completion to problems on hypercubes: a parameterized analysis of the independent set problem
- A new structure for a vertex to be locally t-diagnosable in large multiprocessor systems
- Many-to-many disjoint paths in hypercubes with faulty vertices
- A characterization of cube-hypergraphs
- Cubical graphs and cubical dimensions
- Quaternary n-cubes and isometric words
- On graphs like hypercubes
- scientific article; zbMATH DE number 3972879 (Why is no real title available?)
- On \(k\)-ary \(n\)-cubes and isometric words
- Decomposition of hypercube graphs into paths and cycles having k edges
- A possible optimal design of one-way Hamming network \(H(n,3)\) based on the minimum transmission latency
- Nonlinear piecewise polynomial approximation and multivariate \(BV\) spaces of a Wiener-L. Young type. I.
- Edge-fault-tolerant diameter and bipanconnectivity of hypercubes
- Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges
- On the skewness of Cartesian products with trees
- Structure and Substructure Connectivity of Hypercube-Like Networks
- The maximum length of circuit codes with long bit runs and a new characterization theorem
- Quantum routing in planar graph using perfect state transfer
- Drawing a graph in a hypercube
- Decomposition of hypercube graphs into paths and cycles of length four
- A new measure for locally t-diagnosable under PMC model
- Graphical designs and extremal combinatorics
- Paired many-to-many disjoint path covers of hypercubes with faulty edges
- Bipartite Kneser graphs are Hamiltonian
- Note on the subgraph component polynomial
- Representation of finite graphs as difference graphs of S-units. I
- Structure connectivity and substructure connectivity of twisted hypercubes
- Number of proper paths in edge-colored hypercubes
- On meshy trees
- On graphs with finite-time consensus and their use in gradient tracking
- One-to-one disjoint path covers on k-ary n-cubes
- Genus of the hypercube graph and real moment-angle complexes
- Random walks on binary strings applied to the somatic hypermutation of B-cells
- Proper distance in edge-colored hypercubes
- Structural properties of generalized exchanged hypercubes
- Many-to-many disjoint paths in faulty hypercubes
- Average consensus on networks with quantized communication
- Hypercubes and isometric words based on swap and mismatch distance
- Globally optimal sequencing of optimal reactive dispatch control adjustments to minimize operational losses in transmission systems by graph shortest path, parallel computing, and dynamic programming
- Roman detour domination number of generalized hypercube networks
- Dimensionality of hypercube clusters
- Structure connectivity and substructure connectivity of hypercubes
- A heuristic approach for constructing symmetric Gray codes
- Dense sets and embedding binary trees into hypercubes
- On the surface areas and average distances of meshes and tori
- Vertex extensions of 4-layer graphs and hypercubes
- How many triangles and quadrilaterals are there in an \(n\)-dimensional augmented cube?
- \(\{2,3\}\)-extraconnectivities of hypercube-like networks
- Packing the hypercube
- Fault-tolerant analysis of a class of networks
- Antipodal graphs and oriented matroids
- About uniqueness of the minimal 1-edge extension of hypercube Q4
- Survey on path and cycle embedding in some networks
- Bipanconnectivity of faulty hypercubes with minimum degree
- Avoiding and extending partial edge colorings of hypercubes
- Super fault-tolerance assessment of locally twisted cubes based on the structure connectivity
- Reliability analyses of regular graphs based on edge-structure connectivity
- A remark on rainbow 6-cycles in hypercubes
- New abilities and limitations of spectral graph bisection
- Boolean layer cakes
- Sequential Monte Carlo for counting vertex covers in general graphs
- Extended formulations for perfect domination problems and their algorithmic implications
- Symmetries of quotient networks for doubly periodic patterns on the square lattice
- Express the number of spanning trees in term of degrees
- Cayley properties of the line graphs induced by consecutive layers of the hypercube
- Properties of \(\pi\)-skew graphs with applications
- Cover-preserving order embeddings into Boolean lattices
- A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges
- On path bipancyclicity of hypercubes
- Hamiltonian paths and cycles passing through a prescribed path in hypercubes
- Data center interconnection networks are not hyperbolic
- Paired many-to-many disjoint path covers of hypertori
- Randomly twisted hypercubes: between structure and randomness
- Kolmogorov entropy for classes of convex functions
- Hamiltonian paths with prescribed edges in hypercubes
- Cycles passing through prescribed edges in a hypercube with some faulty edges
- Isometric sets of words and generalizations of the Fibonacci cubes
- Counting spanning trees in cobordism of two circulant graphs
- Counting Hamiltonian cycles in bipartite graphs
- Hypercubes, shuffle-exchange graphs and de Bruijn digraphs
- Reverse binary graphs
- Variations on a hypercube: Embellishments of parallel architectures
- Redefining fractal cubic networks and determining their metric dimension and fault-tolerant metric dimension
- Cluster connectivity of hypercube-based networks under the super fault-tolerance condition
- Integral graphs and \((k,\tau )\)-regular sets
- Rigidity properties of the hypercube via Bakry-Émery curvature
- Edge fault tolerance analysis of a class of interconnection networks
- On middle cube graphs
This page was built for publication: A survey of the theory of hypercube graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1102985)
