Disconnected Cuts in Claw-free Graphs
From MaRDI portal
Publication:6298858
DOI10.4230/LIPIcs.ESA.2018.61zbMath1524.05256arXiv1803.03663MaRDI QIDQ6298858
Barnaby Martin, Daniël Paulusma, Erik Jan van Leeuwen
Publication date: 9 March 2018
Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)
