Submodular potential function for the minimum color spanning tree problem of edge-colored graphs

zbMATH Open1199.05044MaRDI QIDQ3403696FDOQ3403696

Authors: Xueliang Li, Jianhua Tu 

Publication date: 12 February 2010

Recommendations

• scientific article; zbMATH DE number 2085002
• Spanning trees with many or few colors in edge-colored graphs
• Contractors' minimum spanning tree
• On the minimum label spanning tree problem
• On the minimum monochromatic or multicolored subgraph partition problems

zbMATH Keywords

edge-colored graphmaximum color matchingminimum color spanning tree

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15)

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Submodular potential function for the minimum color spanning tree problem of edge-colored graphs

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