✦ LIBER ✦

A note on the f-factor-lattice of bipartite graphs

✍ Scribed by J Rieder

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 406 KB
Volume: 56
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(92)90009-m

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

A note on bipartite subgraphs of triangl

A note on bipartite subgraphs of triangle-free regular graphs

✍ S. C. Locke 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB 👁 2 views

## Abstract Lower bounds on the size of a maximum bipartite subgraph of a triangle‐free __r__‐regular graph are presented.

A note on the exceptional graph of the c

A note on the exceptional graph of the cubic lattice graph characterization

✍ Curtis R Cook 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 253 KB

On K1,k-factorizations of a complete bip

On K1,k-factorizations of a complete bipartite graph

✍ Hong Wang 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 311 KB

We present a necessary condition for a complete bipartite graph K,., to be K,.,-factorizable and a sufficient condition for K,,, to have a K,,,-factorization whenever k is a prime number. These two conditions provide Ushio's necessary and sufficient condition for K,,, to have a K,,,-factorization.

On the bipartite independence number of

On the bipartite independence number of a balanced bipartite graph

✍ Odile Favaron; Pedro Mago; Oscar Ordaz 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 603 KB

Venezuela Ap. 47567, Caracas Favaron, O., P. Mago and 0. Ordaz, On the bipartite independence number of a balanced bipartite graph, Discrete Mathematics 121 (1993) 55-63. The bipartite independence number GI aIp of a bipartite graph G is the maximum order of a balanced independent set of G. Let 6 b

A note on a generalization of eigenvecto

A note on a generalization of eigenvector centrality for bipartite graphs and applications

✍ Peteris Daugulis 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 88 KB