Colored-independence (mostly) on trees

zbMATH Open1293.05125MaRDI QIDQ5405441FDOQ5405441

Authors: Anne Sinko 

Publication date: 2 April 2014

Recommendations

• Colored-independence on paths
• Colored problems in graphs
• An introduction to colored-independence in graphs
• A subexponential algorithm for the coloured tree partition problem
• The Black-and-White Coloring Problem on Trees

zbMATH Keywords

lower independence-partition number

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (4)

• Title not available (Why is that?)
• An introduction to colored-independence in graphs
• Colored-independence on paths
• Minimum partition of an independence system into independent sets

This page was built for publication: Colored-independence (mostly) on trees

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