✦ LIBER ✦

The Bipartite Swapping Trick on Graph Homomorphisms

✍ Scribed by Zhao, Yufei

Book ID: 118197891
Publisher: Society for Industrial and Applied Mathematics
Year: 2011
Tongue: English
Weight: 536 KB
Volume: 25
Category: Article
ISSN: 0895-4801
DOI: 10.1137/100800415

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the approximation of minimum cost hom

On the approximation of minimum cost homomorphism to bipartite graphs

✍ Mastrolilli, Monaldo; Rafiey, Arash 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 359 KB

On the bipartition of graphs

✍ Peter Buser 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 309 KB

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

On the Nullity of Bipartite Graphs

✍ G. R. Omidi 📂 Article 📅 2009 🏛 Springer Japan 🌐 English ⚖ 95 KB

On the nullity of bipartite graphs

✍ Yi-Zheng Fan; Ke-Shi Qian 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 171 KB

On the determinant of bipartite graphs

✍ Bibak, Khodakhast 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 364 KB