✦ LIBER ✦

The spectrum of path factorization of bipartite multigraphs

✍ Scribed by Jian Wang; Bei-liang Du

Publisher: SP Science China Press
Year: 2007
Tongue: English
Weight: 225 KB
Volume: 50
Category: Article
ISSN: 1674-7283
DOI: 10.1007/s11425-007-0033-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

P4k−1-factorization of bipartite multigr

P4k−1-factorization of bipartite multigraphs

✍ Jian Wang; Beiliang Du 📂 Article 📅 2006 🏛 SP Science China Press 🌐 English ⚖ 206 KB

OnK1,k-factorization of bipartite multig

OnK1,k-factorization of bipartite multigraphs

✍ Jian Wang 📂 Article 📅 2008 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 145 KB

Path factors of bipartite graphs

✍ Hong Wang 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 375 KB

## Abstract A path on __n__ vertices is denoted by __P__~__n__~. For any graph __H__, the number of isolated vertices of __H__ is denoted by __i(H)__. Let __G__ be a graph. A spanning subgraph __F__ of __G__ is called a {__P__~3~, __P__~4~, __P__~5~}‐factor of __G__ if every component of __F__ is o

An extension of bipartite multigraphs

✍ D. De Werra 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 702 KB

Usual edge colorings have been generalized in various ways; we wilI consider here essentially good edge colorings as well as equitable edge colorings. It is known that bipartite multigraphs present the property of having an equitable k-coloring for each k 3 2. This implies that they also have a good

The chromatic index of nearly bipartite

The chromatic index of nearly bipartite multigraphs

✍ Larry Eggan; Michael Plantholt 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 672 KB

Path decompositions of multigraphs

✍ Leizhen Cai 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 494 KB

Let G be a loopless finite multigraph. For each vertex x of G, denote its degree and multiplicity by d(x) and p(x) respectively. Define the least even integer 2 p(x), if d(x) is even, the least odd integer 2 p(x), if d(x) is odd. In this paper it is shown that every multigraph G admits a faithful p