Polynomial bounds for centered colorings on proper minor-closed graph classes.
Michal PilipczukSebastian SiebertzPublished in: J. Comb. Theory, Ser. B (2021)
Keyphrases
- bounded degree
- directed graph
- upper bound
- lower bound
- equivalence classes
- graph representation
- random walk
- structured data
- graph theory
- graph theoretic
- graph model
- bipartite graph
- weighted graph
- graph mining
- np complete
- bayesian networks
- membership and equivalence queries
- convex combinations
- graph coloring
- worst case
- queueing networks
- average case
- directed acyclic graph
- class labels