✦ LIBER ✦

An extremal bandwidth problem for bipartite graphs

✍ Scribed by Robert C. Brigham; Julie R. Carrington; Ronald D. Dutton; Joseph Fiedler; Richard P. Vitray

Publisher: John Wiley and Sons
Year: 2000
Tongue: English
Weight: 119 KB
Volume: 35
Category: Article
ISSN: 0364-9024
DOI: 10.1002/1097-0118(200012)35:4<278::aid-jgt5>3.0.co;2-u

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum bandwidth problem for embedding

Minimum bandwidth problem for embedding graphs in cycles

✍ Lin, Yixun 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 98 KB 👁 2 views

For the bandwidth B(G) and the cyclic bandwidth B c (G) of a graph G, it is known that 1 2 B(G) °Bc (G) °B(G). In this paper, the criterion conditions for two extreme cases B c (G) Å B(G) and B c (G) Å 1 2 B(G) are studied. From this, some exact values of B c (G) for special graphs can be obtained.

An extremal problem for subdivisions ofK

An extremal problem for subdivisions ofK?5

✍ Mader, W. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 248 KB

It is proved that every graph G with G ≥ 2|G| -5, |G| ≥ 6, and girth at least 5, except the Petersen graph, contains a subdivision of K - 5 , the complete graph on five vertices minus one edge.

An edge coloring problem for graph produ

An edge coloring problem for graph products

✍ Faudree, R. J.; Gy�rf�s, Andr�as; Schelp, R. H. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 315 KB

The edges of the Cartesian product of graphs G x H a r e to be colored with the condition that all rectangles, i.e., K2 x K2 subgraphs, must be colored with four distinct colors. The minimum number of colors in such colorings is determined for all pairs of graphs except when G is 5-chromatic and H

Deferred-query: An efficient approach fo

Deferred-query: An efficient approach for some problems on interval graphs

✍ Chang, Maw-Shang; Peng, Sheng-Lung; Liaw, Jenn-Liang 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 99 KB 👁 1 views

This paper introduces the idea of a deferred-query approach to design O(n) algorithms for the domatic partition, optimal path cover, Hamiltonian path, Hamiltonian circuit, and maximum matching problems on interval graphs given n endpoint-sorted intervals. The previous best-known algorithms run in O(

On quadrilaterals in layers of the cube

On quadrilaterals in layers of the cube and extremal problems for directed and oriented graphs

✍ Schelp, Richard H.; Thomason, Andrew 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 286 KB 👁 1 views

Erdős has conjectured that every subgraph of the n-cube Q n having more than (1/2+o(1))e(Q n ) edges will contain a 4-cycle. In this note we consider 'layer' graphs, namely, subgraphs of the cube spanned by the subsets of sizes k -1, k and k + 1, where we are thinking of the vertices of Q n as being

A simpleO(n2) algorithm for the all-pair

A simpleO(n2) algorithm for the all-pairs shortest path problem on an interval graph

✍ Mirchandani, Prakash 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 288 KB 👁 1 views

Let G denote an interval graph with n vertices and unit weight edges. In this paper, we present a simple O(n') algorithm for solving the all-pairs shortest path problem on graph G . A recent algorithm for this problem has the same time-complexity but is fairly complicated to describe. However, our a