The complexity of list edge-partitions for simple graphs

DOI10.1016/J.EJC.2016.11.006zbMATH Open1352.05154OpenAlexW2567090840MaRDI QIDQ730267FDOQ730267

Authors: 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

Recommendations

• List Partitions
• LATIN 2004: Theoretical Informatics
• The monotonicity property of \(M\)-partition problems
• Two algorithms for general list matrix partitions
• Matrix partitions of perfect graphs

zbMATH Keywords

\(M\)-edge-partition problem

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Graph theory with applications
• The NP-Completeness of Edge-Coloring
• The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
• Title not available (Why is that?)
• List Partitions
• Matrix partitions of perfect graphs
• Graph partitions with prescribed patterns
• On stable cutsets in graphs
• List homomorphisms to reflexive graphs
• Duality and Polynomial Testing of Tree Homomorphisms
• List matrix partitions of chordal graphs
• Generalized colouring (matrix partitions) of cographs
• Coloring graphs with stable cutsets
• Matrix partitions of split graphs

Cited In (3)

• Graph partitions with prescribed patterns
• The monotonicity property of \(M\)-partition problems
• Matrix partitions of split graphs

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

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