2K2 vertex-set partition into nonempty parts
Publication:3503567
DOI10.1016/j.endm.2008.01.050zbMath1341.05205MaRDI QIDQ3503567
Simone Dantas, Sulamita Klein, Elaine M. Eschen, Celina M. Herrera de Figueiredo, Luérbio Faria
Publication date: 5 June 2008
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2008.01.050
analysis of algorithms; computational difficulty of problems; structural graph theory; problem complexity
68W40: Analysis of algorithms
05A18: Partitions of sets
05C10: Planar graphs; geometric and topological aspects of graph theory
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Cites Work