Tractable Feedback Vertex Sets in Restricted Bipartite Graphs

2011 ◽  
pp. 424-434 ◽  
Author(s):  
Wei Jiang ◽  
Tian Liu ◽  
Ke Xu
Keyword(s):  
Bipartite Graphs ◽  
Vertex Sets

scholarly journals On Minimum Feedback Vertex Sets in Bipartite Graphs and Degree-Constraint Graphs

2013 ◽  
Vol E96.D (11) ◽  
pp. 2327-2332 ◽  
Author(s):  
Asahi TAKAOKA ◽  
Satoshi TAYU ◽  
Shuichi UENO
Keyword(s):  
Bipartite Graphs ◽  
Degree Constraint ◽  
Vertex Sets

scholarly journals Feedback vertex sets on restricted bipartite graphs

2013 ◽  
Vol 507 ◽  
pp. 41-51 ◽  
Author(s):  
Wei Jiang ◽  
Tian Liu ◽  
Chaoyi Wang ◽  
Ke Xu
Keyword(s):  
Bipartite Graphs ◽  
Vertex Sets

scholarly journals Circular convex bipartite graphs: Feedback vertex sets

2014 ◽  
Vol 556 ◽  
pp. 55-62 ◽  
Author(s):  
Tian Liu ◽  
Min Lu ◽  
Zhao Lu ◽  
Ke Xu
Keyword(s):  
Bipartite Graphs ◽  
Vertex Sets ◽  
Convex Bipartite Graphs

scholarly journals Cooperative Colorings of Trees and of Bipartite Graphs

10.37236/8111 ◽  
2020 ◽  
Vol 27 (1) ◽  
Author(s):  
Ron Aharoni ◽  
Eli Berger ◽  
Maria Chudnovsky ◽  
Frédéric Havet ◽  
Zilin Jiang
Keyword(s):  
Maximum Degree ◽  
Bipartite Graphs ◽  
Vertex Set ◽  
Vertex Sets

Given a system $(G_1, \ldots ,G_m)$ of graphs on the same vertex set $V$, a cooperative coloring is a choice of vertex sets $I_1, \ldots ,I_m$, such that $I_j$ is independent in $G_j$ and $\bigcup_{j=1}^{m}I_j = V$. For a class $\mathcal{G}$ of graphs, let $m_{\mathcal{G}}(d)$ be the minimal $m$ such that every $m$ graphs from $\mathcal{G}$ with maximum degree $d$ have a cooperative coloring. We prove that $\Omega(\log\log d) \le m_\mathcal{T}(d) \le O(\log d)$ and $\Omega(\log d)\le m_\mathcal{B}(d) \le O(d/\log d)$, where $\mathcal{T}$ is the class of trees and $\mathcal{B}$ is the class of bipartite graphs.

Bipartite Graphs and their Applications

1998 ◽  
Author(s):  
Armen S. Asratian ◽  
Tristan M. J. Denley ◽  
Roland Häggkvist
Keyword(s):  
Bipartite Graphs
Sign in / Sign up

Export Citation Format

Share Document