The complexity of list edge-partitions for simple graphs

DOI10.1016/j.ejc.2016.11.006zbMath1352.05154OpenAlexW2567090840MaRDI QIDQ730267

Payam Valadkhan

Publication date: 27 December 2016

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

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

zbMATH Keywords

\(M\)-edge-partition problem

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Matrix partitions of split graphs ⋮ Graph partitions with prescribed patterns

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• List matrix partitions of chordal graphs
• List homomorphisms to reflexive graphs
• Coloring graphs with stable cutsets
• On stable cutsets in graphs
• Matrix partitions of perfect graphs
• Graph partitions with prescribed patterns
• Matrix partitions of split graphs
• The NP-Completeness of Edge-Coloring
• The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
• List Partitions
• Duality and Polynomial Testing of Tree Homomorphisms

This page was built for publication: The complexity of list edge-partitions for simple graphs