✦ LIBER ✦

The bipartite edge frustration of extension of splice and link graphs

✍ Scribed by Zahra Yarahmadi

Book ID: 104000905
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 312 KB
Volume: 23
Category: Article
ISSN: 0893-9659
DOI: 10.1016/j.aml.2010.04.039

No coin nor oath required. For personal study only.

✦ Synopsis

The smallest number of edges that have to be deleted from a graph G to obtain a bipartite spanning subgraph is called the bipartite edge frustration of G and denoted by ϕ(G). In this paper we extend the splice and link for two graphs and determine their bipartite edge frustration. As an application, the bipartite edge frustration of a polybuckyball is computed.

📜 SIMILAR VOLUMES

The bipartite edge frustration of hierar

The bipartite edge frustration of hierarchical product of graphs

✍ Yarahmadi, Zahra; Ashrafi, Ali Reza 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 197 KB

The bipartite edge frustration of graphs

The bipartite edge frustration of graphs under subdivided edges and their related sums

✍ Zahra Yarahmadi; Ali Reza Ashrafi 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 343 KB

NP completeness of the edge precoloring

NP completeness of the edge precoloring extension problem on bipartite graphs

✍ Jiří Fiala 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 63 KB 👁 1 views

## Abstract We show that the following problem is __NP__ complete: Let __G__ be a cubic bipartite graph and __f__ be a precoloring of a subset of edges of __G__ using at most three colors. Can __f__ be extended to a proper edge 3‐coloring of the entire graph __G__? This result provides a natural co

Extremal properties of the bipartite ver

Extremal properties of the bipartite vertex frustration of graphs

✍ Zahra Yarahmadi; Ali Reza Ashrafi 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 242 KB

The smallest number of vertices that have to be deleted from a graph G to obtain a bipartite subgraph is called the bipartite vertex frustration of G and denoted by ψ(G). In this paper, some extremal properties of this graph invariant are presented. Moreover, we present an exact formula for the bipa

Covering the edges of bipartite graphs u

Covering the edges of bipartite graphs using graphs

✍ Dorit S. Hochbaum; Asaf Levin 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 570 KB

The number of linear extensions of bipar

The number of linear extensions of bipartite graphs

✍ Grzegorz Stachowiak 📂 Article 📅 1988 🏛 Springer Netherlands 🌐 English ⚖ 124 KB

The number of linear extensions among the orientations of a bipartite graph is maximum just if the orientation itself is bipartite, the natural one.