✦ LIBER ✦

On uniqueness of prime bipartite factors of graphs

✍ Scribed by Hammack, Richard H.

Book ID: 120497746
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 457 KB
Volume: 313
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2013.01.006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Symmetric Bipartite Graphs of Prime Vale

Symmetric Bipartite Graphs of Prime Valency

✍ Lorimer, Peter 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 426 KB

The chromatic uniqueness of complete bip

The chromatic uniqueness of complete bipartite graphs

✍ Shaoji Xu 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 585 KB

Xu, S., The chromatic uniqueness of complete bipartite graphs, Discrete Mathematics 94 (1991) 153-159. This paper is partitioned into two parts. In the first part we determine the maximum number of induced complete bipartite subgraphs in graphs with some given conditions. Using a theorem given in th

On two-factors of bipartite regular grap

On two-factors of bipartite regular graphs

✍ J.D. Horton 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 654 KB

The set of two-factors of a bipartite k-regular graph, k > 2, spans the cycle space of the graph. In addition, a new non-hamiltonian T-connected bicubic graph on 92 vertices is constructed.

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

Some families of chromatically unique bi

Some families of chromatically unique bipartite graphs

✍ Xiebin Chen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 287 KB

On 2-factors of a bipartite graph

✍ Wang, Hong 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 191 KB 👁 2 views

In this article, we consider the following problem: Given a bipartite graph G and a positive integer k, when does G have a 2-factor with exactly k components? We will prove that if , then, for any bipartite graph H = (U 1 , U 2 ; F ) with |U 1 | ≤ n, |U 2 | ≤ n and ∆(H) ≤ 2, G contains a subgraph i