Pages that link to "Item:Q2574670"
From MaRDI portal
The following pages link to A polynomial algorithm for finding \((g,f)\)-colorings orthogonal to stars in bipartite graphs (Q2574670):
Displaying 4 items.
- A note on the \((g, f)\)-coloring (Q949352) (← links)
- Randomly orthogonal factorizations with constraints in bipartite networks (Q1663915) (← links)
- Discussions on orthogonal factorizations in digraphs (Q2125658) (← links)
- A generic framework for approximation analysis of greedy algorithms for star bicoloring (Q5085266) (← links)