Colored-independence on paths

MaRDI QIDQ3089231zbMATH OpenFDO

Authors Anne Sinko, Peter Slater

Publication date 24 August 2011

zbMATH Keywords

scheduling problemstorage problemplacing elements together

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Deterministic scheduling theory in operations research (90B35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Colored-independence (mostly) on trees
• Packing problems in edge-colored graphs
• Colored problems in graphs
• On the complexity of a restricted list-coloring problem
• scientific article; zbMATH DE number 4202293

Cited in

(2)

• scientific article; zbMATH DE number 6712803 (Why is no real title available?)
• Colored-independence (mostly) on trees

This page was built for publication: Colored-independence on paths

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