The monotonicity property of \(M\)-partition problems

DOI10.1016/j.ejc.2017.12.001zbMath1384.05134OpenAlexW2794063315MaRDI QIDQ1746577

Payam Valadkhan, Mohammad-Javad Davari

Publication date: 25 April 2018

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2017.12.001

zbMATH Keywords

monotonicity property of \(M\)-partition problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of H-coloring
• List homomorphisms to reflexive graphs
• Matrix partitions of perfect graphs
• Graph partitions with prescribed patterns
• The Complexity of the List Partition Problem for Graphs
• List Partitions
• Bi‐arc graphs and the complexity of list homomorphisms

This page was built for publication: The monotonicity property of \(M\)-partition problems