4 citations · 12 across the 12 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.DS2018
A Complexity Dichotomy for Critical Values of the b-Chromatic Number of Graphs
Lars Jaffke, Paloma T. Lima
A -coloring of a graph is a proper coloring of its vertices such that each color class contains a vertex that has at least one neighbor in all the other color classes. The b…
cs.DS2018
Classifying k-Edge Colouring for H-free Graphs
Esther Galby, Paloma T. Lima, Daniel Paulusma +1
A graph is -free if it does not contain an induced subgraph isomorphic to . For every integer and every graph , we determine the computational complexity of -Edge C…
cs.DS2018
Parameterized Aspects of Strong Subgraph Closure
Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis +2
Motivated by the role of triadic closures in social networks, and the importance of finding a maximum subgraph avoiding a fixed pattern, we introduce and initiate the parameterized…