Add to ORKGThis paper discusses the problem of finding the maximum number of edges E(m,n,B) in a bipartite graph having partite set sizes m and n and bandwidth B. Exact values for E(m,n,B) are found for many cases. (C) 2000 John Wiley & Sons, Inc
AbstractA graph G is said to have bandwidth at most b, if there exists a labeling of the vertices by...
AbstractGiving a partial solution to a problem of Bialostocki and Dierker, we determine the maximum ...
The bandwidth of a graph is the minimum, over vertex labelings with distinct integers, of the maximu...
This paper discusses the problem of finding the maximum number of edges E(m,n,B) in a bipartite grap...
AbstractThe graph bandwidth problem is a well-known NP-complete problem. The relation between size o...
This thesis presents a partial solution to the broad problem on bandwidths. The bandwidth problem f...
AbstractVizing established an upper bound on the size of a graph of given order and radius. We find ...
The relationship between the graphical invariants bandwidth and number of edges is considered. Bound...
The edge-bandwidth problem is an analog of the classical bandwidth problem, in which one has to labe...
AbstractThe relationship between the graphical invariants bandwidth and number of edges is considere...
The bandwidth problem is the problem of numbering the vertices of a given graph G such that the max...
AbstractThe edge-bandwidth problem is an analog of the classical bandwidth problem, in which one has...
. The bandwidth of a graph G is the minimum of the maximum difference between adjacent labels when t...
Research Doctorate - Doctor of Philosophy (PhD)The question of Turán on the maximum number of edges ...
AbstractThe bandwidth of a graph G is the minimum of the maximum difference between adjacent labels ...
AbstractA graph G is said to have bandwidth at most b, if there exists a labeling of the vertices by...
AbstractGiving a partial solution to a problem of Bialostocki and Dierker, we determine the maximum ...
The bandwidth of a graph is the minimum, over vertex labelings with distinct integers, of the maximu...
This paper discusses the problem of finding the maximum number of edges E(m,n,B) in a bipartite grap...
AbstractThe graph bandwidth problem is a well-known NP-complete problem. The relation between size o...
This thesis presents a partial solution to the broad problem on bandwidths. The bandwidth problem f...
AbstractVizing established an upper bound on the size of a graph of given order and radius. We find ...
The relationship between the graphical invariants bandwidth and number of edges is considered. Bound...
The edge-bandwidth problem is an analog of the classical bandwidth problem, in which one has to labe...
AbstractThe relationship between the graphical invariants bandwidth and number of edges is considere...
The bandwidth problem is the problem of numbering the vertices of a given graph G such that the max...
AbstractThe edge-bandwidth problem is an analog of the classical bandwidth problem, in which one has...
. The bandwidth of a graph G is the minimum of the maximum difference between adjacent labels when t...
Research Doctorate - Doctor of Philosophy (PhD)The question of Turán on the maximum number of edges ...
AbstractThe bandwidth of a graph G is the minimum of the maximum difference between adjacent labels ...
AbstractA graph G is said to have bandwidth at most b, if there exists a labeling of the vertices by...
AbstractGiving a partial solution to a problem of Bialostocki and Dierker, we determine the maximum ...
The bandwidth of a graph is the minimum, over vertex labelings with distinct integers, of the maximu...