AbstractIn this note, we give a counter-example for a lemma of Harary and Lewinter about partitioning the hypercube with an arbitrary number of vertex-disjoint paths of even length
©2021 The Author(s). Published by Elsevier Ltd. This is an open access article under the CC BY-NC-ND...
AbstractAn isometric path is merely any shortest path between two vertices. If the vertices of the h...
AbstractFor n = 2k − 1 we prove, via a counting argument, that for any tree J with vertex set T, if ...
AbstractThe aim of this paper is to prove that double starlike trees are embedable into hypercubes, ...
The aim of this thesis is to prove that certain family of graphs are embeddable into hypercube. Anot...
The aim of this thesis is to prove that certain family of graphs are embeddable into hypercube. Anot...
The aim of this thesis is to prove that certain family of graphs are embeddable into hypercube. Anot...
Let G be a graph that is a subgraph of some n-dimensional hypercube Qn. For sufficiently large n, St...
Abstract. A starlike tree (or a quasistar) is a subdivision of a star tree. A family of hypercube-li...
AbstractThe aim of this paper is to prove that certain trees are spanning trees of the hypercube Qn....
The problem of embedding graphs into other graphs is much studied in the graph theory. In fact, much...
The problem of partitioning a graph into two sets of nodes such that the sets have a certain propert...
AbstractTwo methods of partitioning an n-dimensional hypercube are considered. In the first method, ...
The problem of embedding graphs into other graphs is much studied in the graph theory. In fact, much...
The problem of embedding graphs into other graphs is much studied in the graph theory. In fact, much...
©2021 The Author(s). Published by Elsevier Ltd. This is an open access article under the CC BY-NC-ND...
AbstractAn isometric path is merely any shortest path between two vertices. If the vertices of the h...
AbstractFor n = 2k − 1 we prove, via a counting argument, that for any tree J with vertex set T, if ...
AbstractThe aim of this paper is to prove that double starlike trees are embedable into hypercubes, ...
The aim of this thesis is to prove that certain family of graphs are embeddable into hypercube. Anot...
The aim of this thesis is to prove that certain family of graphs are embeddable into hypercube. Anot...
The aim of this thesis is to prove that certain family of graphs are embeddable into hypercube. Anot...
Let G be a graph that is a subgraph of some n-dimensional hypercube Qn. For sufficiently large n, St...
Abstract. A starlike tree (or a quasistar) is a subdivision of a star tree. A family of hypercube-li...
AbstractThe aim of this paper is to prove that certain trees are spanning trees of the hypercube Qn....
The problem of embedding graphs into other graphs is much studied in the graph theory. In fact, much...
The problem of partitioning a graph into two sets of nodes such that the sets have a certain propert...
AbstractTwo methods of partitioning an n-dimensional hypercube are considered. In the first method, ...
The problem of embedding graphs into other graphs is much studied in the graph theory. In fact, much...
The problem of embedding graphs into other graphs is much studied in the graph theory. In fact, much...
©2021 The Author(s). Published by Elsevier Ltd. This is an open access article under the CC BY-NC-ND...
AbstractAn isometric path is merely any shortest path between two vertices. If the vertices of the h...
AbstractFor n = 2k − 1 we prove, via a counting argument, that for any tree J with vertex set T, if ...
DOI
Add to ORKG