scientific article; zbMATH DE number 1555935
From MaRDI portal
zbMath0953.05500MaRDI QIDQ4525701
Publication date: 24 January 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Parallel algorithms in computer science (68W10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
The existence of subdigraphs with orthogonal factorizations in digraphs, Randomly orthogonal factorizations with constraints in bipartite networks, Simple reduction of f-colorings to edge-colorings, Subgraphs with orthogonal factorizations in graphs, Subgraphs with Orthogonal $$[0,k_{i}_{1}^{n}$$ [ 0 , k i ] 1 n -Factorizations in Graphs], Some problems on factorizations with constraints in bipartite graphs, Decompositions to degree-constrained subgraphs are simply reducible to edge-colorings