scientific article; zbMATH DE number 1796973

MaRDI QIDQ4551367zbMATH OpenFDO

Authors Xiao Zhou, Takao Nishizeki

Publication date 5 September 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2108/21080288

zbMATH Keywords

algorithmedge-coloringtree

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Algorithm for the cost edge-coloring of trees
• Minimum cost edge-colorings of trees can be reduced to matchings
• A linear time algorithm for edge coloring of binomial trees
• Edge-colorings of weighted graphs (extended abstract)
• Edge-chromatic sum of trees and bounded cyclicity graphs

Cited in

(9)

• Mixed graph edge coloring
• The color cost of a caterpillar
• Algorithm for the cost edge-coloring of trees
• A linear time algorithm for edge coloring of binomial trees
• A note on polynomial algorithm for cost coloring of bipartite graphs with \(\Delta \leq 4\)
• Minimum cost edge-colorings of trees can be reduced to matchings
• scientific article; zbMATH DE number 3898919 (Why is no real title available?)
• Algorithms for coloring quadtrees
• An exact algorithm for the adjacent vertex distinguishing sum edge coloring problem

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 Q4551367)