Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs
From MaRDI portal
Publication:3297773
DOI10.1007/978-3-030-38919-2_21zbMath1440.68140MaRDI QIDQ3297773
Christian Komusiewicz, Niels Grüttemeier, Frank Sommer, Nils Morawietz
Publication date: 20 July 2020
Published in: SOFSEM 2020: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-38919-2_21
68R10: Graph theory (including graph drawing) in computer science
05C15: Coloring of graphs and hypergraphs
05C40: Connectivity
68Q27: Parameterized complexity, tractability and kernelization