✦ LIBER ✦

Color-feasible sequences of a multigraph

✍ Scribed by D. de Werra

Publisher: John Wiley and Sons
Year: 1978
Tongue: English
Weight: 462 KB
Volume: 8
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230080105

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Multiply balanced edge colorings of mult

Multiply balanced edge colorings of multigraphs

✍ M. A. Bahmanian; C. A. Rodger 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 259 KB

## Abstract In this article, a theorem is proved that generalizes several existing amalgamation results in various ways. The main aim is to disentangle a given edge‐colored amalgamated graph so that the result is a graph in which the edges are shared out among the vertices in ways that are fair wit

Edge-coloring of multigraphs: Recoloring

Edge-coloring of multigraphs: Recoloring technique

✍ Mark K. Goldberg 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 626 KB

Applications of edge coloring of multigr

Applications of edge coloring of multigraphs to vertex coloring of graphs

✍ H.A. Kierstead 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 754 KB

A Linear Algorithm for Edge-Coloring Ser

A Linear Algorithm for Edge-Coloring Series–Parallel Multigraphs

✍ Xiao Zhou; Hitoshi Suzuki; Takao Nishizeki 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 313 KB

Many combinatorial problems can be efficiently solved for series᎐parallel multigraphs. However, the edge-coloring problem of finding the minimum number of colors required for edge-coloring given graphs is one of a few well-known combinatorial problems for which no efficient algorithms have been obta

Sequencing in nanofabricated arrays: A f

Sequencing in nanofabricated arrays: A feasibility study

✍ Dr. Thomas Duke; Glen Monnelly; Robert H. Austin; Edward C. Cox 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 671 KB

## Abstract The feasibility of using nanofabricated arrays as electrophoretic chambers for DNA sequencing is investigated. A specific array design, consisting of rows of closely spaced posts, separated by longer open spaces, is proposed. Molecules driven through the array by an electric field get h

The List Chromatic Index of a Bipartite

The List Chromatic Index of a Bipartite Multigraph

✍ F. Galvin 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 243 KB

For a bipartite multigraph, the list chromatic index is equal to the chromatic index (which is, of course, the same as the maximum degree). This generalizes Janssen's result on complete bipartite graphs \(K_{m, n}\) with \(m \neq n\); in the case of \(K_{n, n}\) it answers a question of Dinitz. (The