scientific article; zbMATH DE number 1555935

MaRDI QIDQ4525701zbMATH OpenFDO

Authors Xiao Zhou, Takao Nishizeki

Publication date 24 January 2001

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Parallel algorithms in computer science (68W10)

Recommendations

• Edge-Coloring and f-Coloring for Various Classes of Graphs
• On the fg-coloring of graphs
• Algorithms for finding f-colorings of partial k-trees
• f-colorings of some graphs of f-class 1
• On the f-coloring of multigraphs

Cited in

(18)

• Decompositions to degree-constrained subgraphs are simply reducible to edge-colorings
• Some results on an edge coloring problem of Folkman and Fulkerson
• Randomly orthogonal factorizations with constraints in bipartite networks
• Some problems on factorizations with constraints in bipartite graphs
• The existence of subdigraphs with orthogonal factorizations in digraphs
• A classification of edge-colored graphs based on properly colored walks
• Subgraphs with orthogonal factorizations in graphs
• On the fg-coloring of graphs
• The edge-labeling and vertex-colors of \(K_n\)
• Edge-colorings of some large graphs on alphabets
• Subgraphs with orthogonal \([0,k_{i}]_{1}^{n}\)-factorizations in graphs
• Edge-Coloring Problems for Graphs.
• Edge-Coloring and f-Coloring for Various Classes of Graphs
• Simple reduction of f-colorings to edge-colorings
• Algorithms for finding f-colorings of partial k-trees
• Remarks on restricted fractional (g, f)-factors in graphs
• Density-sensitive algorithms for (+1)-edge coloring
• A note on the \((g, f)\)-coloring

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4525701)