• Corpus ID: 162168562

Clustered Graph Coloring and Layered Treewidth

@article{Liu2019ClusteredGC,
  title={Clustered Graph Coloring and Layered Treewidth},
  author={Chun-Hung Liu and David R. Wood},
  journal={arXiv: Combinatorics},
  year={2019}
}
A graph coloring has bounded clustering if each monochromatic component has bounded size. This paper studies clustered coloring, where the number of colors depends on an excluded complete bipartite subgraph. This is a much weaker assumption than previous works, where typically the number of colors depends on an excluded minor. This paper focuses on graph classes with bounded layered treewidth, which include planar graphs, graphs of bounded Euler genus, graphs embeddable on a fixed surface with… 

Clustered Coloring of Graphs Excluding a Subgraph and a Minor

A graph coloring has bounded clustering if each monochromatic component has bounded size. Equivalently, it is a partition of the vertices into induced subgraphs with bounded size components. This

Clustered Coloring of Graphs with Bounded Layered Treewidth and Bounded Degree

The main theorem says that every graph with layered treewidth at most k and with maximum degree at most ∆ is 3 -colorable with clustering O ( k 19 ∆ 37 ) .

Planar Graphs have Bounded Queue-Number Vida Dujmović

We show that planar graphs have bounded queue-number, thus proving a conjecture of Heath, Leighton and Rosenberg from 1992. The key to the proof is a new structural tool called layered partitions,

Clustered Variants of Hajós' Conjecture

Clustered colouring of graph classes with bounded treedepth or pathwidth.

The "clustered chromatic number" of a class of graphs is the minimum integer $k$ such that for some integer $c$ every graph in the class is $k$-colourable with monochromatic components of size at

Colouring Strong Products

Recent results show that several important graph classes can be embedded as subgraphs of strong products of simpler graphs classes (paths, small cliques, or graphs of bounded treewidth). This paper

The cases for t ≤ 3 of Conjecture 1 . 1 follow from the correctness of Hajós ’ conjecture for t ≤ 3

Hadwiger and Hajós conjectured that for every positive integer t, Kt+1-minor free graphs and Kt+1-topological minor free graphs are properly t-colorable, respectively. Clustered coloring version of

Separating layered treewidth and row treewidth

This paper answers the question in the negative of whether row treewidth is bounded by a function of layered trewidth and proves an analogous result for layered pathwidth and row pathwidth.

Asymptotic Dimension of Minor-Closed Families and Assouad-Nagata Dimension of Surfaces

It is proved that every proper minor-closed family of graphs has asymptotic dimension at most 2, which gives optimal answers to a question of Fujiwara and Papasoglu and (in a strong form) to a problem raised by Ostrovskii and Rosenthal on minor excluded groups.

References

SHOWING 1-10 OF 48 REFERENCES

Clustered Coloring of Graphs Excluding a Subgraph and a Minor

A graph coloring has bounded clustering if each monochromatic component has bounded size. Equivalently, it is a partition of the vertices into induced subgraphs with bounded size components. This

Defective and Clustered Graph Colouring

Consider the following two ways to colour the vertices of a graph where the requirement that adjacent vertices get distinct colours is relaxed. A colouring has "defect" $d$ if each monochromatic

Islands in minor-closed classes. I. Bounded treewidth and separators

The clustered chromatic number of a graph class is the minimum integer $t$ such that for some $C$ the vertices of every graph in the class can be colored in $t$ colors so that every monochromatic

Defective and Clustered Colouring of Sparse Graphs

An (improper) graph colouring has "defect" $d$ if each monochromatic subgraph has maximum degree at most $d$, and has "clustering" $c$ if each monochromatic component has at most $c$ vertices. This

New bounds on the edge number of a k-map graph

It is shown that for every positive multiple k of 6, there are infinitely many integers n such that some k-map graph with n vertices has at least $({11 \over 12}{k} + {1 \over 3}) {n}$ edges.

Structure of Graphs with Locally Restricted Crossings

Relations between the size, treewidth, and local crossing number (maximum number of crossings per edge) of graphs embedded on topological surfaces are considered and tight bounds are shown that improve a previously known $O((k+1)^{3/4}n^{1/2})$treewidth bound.

Layered separators in minor-closed graph classes with applications

Applications of a New Separator Theorem for String Graphs

  • J. FoxJ. Pach
  • Mathematics
    Combinatorics, Probability and Computing
  • 2013
In the present note, Matoušek almost completely settled a conjecture of the authors by showing that every string graph with m edges admits a vertex separator of size $O(\sqrt{m}\log m)$.

Graph Colouring with No Large Monochromatic Components

It is shown that mcc2(G) = O(n2/3) for any n-vertex graph G ∈ .

Orthogonal Tree Decompositions of Graphs

This paper studies graphs that have two tree decompositions with the property that every bag from the first decomposition has a bounded-size intersection with every bags from the second decomposition, and concludes a new lower bound on the crossing number of a graph in terms of its treewidth.