Polynomial bounds for centered colorings on proper minor-closed graph classes.
Michal PilipczukSebastian SiebertzPublished in: CoRR (2018)
Keyphrases
- bounded degree
- random walk
- equivalence classes
- directed graph
- upper bound
- graph representation
- graph theoretic
- graph partitioning
- spanning tree
- lower bound
- convex combinations
- graph theory
- lower and upper bounds
- graph structure
- upper and lower bounds
- error bounds
- graph model
- graph mining
- weighted graph
- queueing networks
- optimal solution