Pages that link to "Item:Q3057057"
From MaRDI portal
The following pages link to Balanced coloring of bipartite graphs (Q3057057):
Displaying 18 items.
- Testing whether a digraph contains \(H\)-free \(k\)-induced subgraphs (Q955032) (← links)
- Split and balanced colorings of complete graphs (Q1301634) (← links)
- Balanced colourings of strongly regular graphs (Q1779485) (← links)
- Semi-balanced colorings of graphs: Generalized 2-colorings based on a relaxed discrepancy condition (Q1889829) (← links)
- Balanced polychromatic 2-coloring of triangulations (Q2062902) (← links)
- Role coloring bipartite graphs (Q2081494) (← links)
- Cooperative colorings of trees and of bipartite graphs (Q2294110) (← links)
- New exact algorithms for the 2-constraint satisfaction problem (Q2437759) (← links)
- Approximations for the two-machine cross-docking flow shop problem (Q2446855) (← links)
- On the balanceability of some graph classes (Q2659061) (← links)
- A note on a Caro-Wei bound for the bipartite independence number in graphs (Q2659196) (← links)
- Balanced list edge-colourings of bipartite graphs (Q2861497) (← links)
- Multiply balanced edge colorings of multigraphs (Q2897208) (← links)
- (Q4536356) (← links)
- Bipartite Independence Number in Graphs with Bounded Maximum Degree (Q4992836) (← links)
- Balanced Colorings and Bifurcations in Rivalry and Opinion Networks (Q4997460) (← links)
- Symmetry-driven network reconstruction through pseudobalanced coloring optimization (Q5101076) (← links)
- Extremal bipartite independence number and balanced coloring (Q6115783) (← links)