A polynomial algorithm for finding \((g,f)\)-colorings orthogonal to stars in bipartite graphs
From MaRDI portal
Publication:2574670
zbMath1080.05032MaRDI QIDQ2574670
Publication date: 30 November 2005
Published in: Science in China. Series A (Search for Journal in Brave)
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (2)
Discussions on orthogonal factorizations in digraphs ⋮ Randomly orthogonal factorizations with constraints in bipartite networks
This page was built for publication: A polynomial algorithm for finding \((g,f)\)-colorings orthogonal to stars in bipartite graphs
