z-logo
open-access-imgOpen Access
(Sub)Fall Coloring and B-Coloring Parameterized by Treewidth
Author(s) -
Davi de Andrade,
Ana Silva
Publication year - 2022
Language(s) - English
Resource type - Conference proceedings
DOI - 10.5753/etc.2022.222982
Subject(s) - combinatorics , treewidth , complete coloring , greedy coloring , fractional coloring , parameterized complexity , vertex (graph theory) , mathematics , edge coloring , graph coloring , list coloring , graph , discrete mathematics , graph power , pathwidth , line graph

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here