Graph colorings with restricted bicolored subgraphs: I. Acyclic, star, and treewidth colorings

@article{Bradshaw2022GraphCW,
  title={Graph colorings with restricted bicolored subgraphs: I. Acyclic, star, and treewidth colorings},
  author={Peter Bradshaw},
  journal={Journal of Graph Theory},
  year={2022},
  volume={100},
  pages={362 - 370}
}
  • Peter Bradshaw
  • Published 30 August 2020
  • Mathematics
  • Journal of Graph Theory
We show that for any fixed integer m ≥ 1 $m\ge 1$ , a graph of maximum defiggree Δ ${\rm{\Delta }}$ has a coloring with O ( Δ ( m + 1 ) ∕ m ) $O({{\rm{\Delta }}}^{(m+1)\unicode{x02215}m})$ colors in which every connected bicolored subgraph contains at most m $m$ edges. This result unifies previously known upper bounds on the number of colors sufficient for certain types of graph colorings, including star colorings, for which O ( Δ 3 ∕ 2 ) $O({{\rm{\Delta }}}^{3\unicode{x02215}2})$ colors… 

References

SHOWING 1-10 OF 14 REFERENCES

Improved bounds for centered colorings

Upper bounds for the maximum number of colors needed in a $p$-centered coloring of graphs from several widely studied graph classes are given.

Bounds on vertex colorings with restrictions on the union of color classes

This paper considers proper colorings in which the union of any j color classes induces a subgraph which has no copy of any member of ℱ, and obtains upper bounds on the minimum number of colors sufficient to obtain such a coloring.

Star coloring of graphs

The exact value of the star chromatic number of different families of graphs, such as trees, cycles, complete bipartite graphs, outerplanar graphs and 2-dimensional grids, is given.

On the Complexity of Some Coloring Games

It is shown that for both variants of the game, the problem of determining whether there is a winning strategy for player 1 is PSPACE-complete for any C with |C|≥3, but the problems are solvable in , and time, respectively, if |C |=2.

Acyclic Coloring of Graphs

It is shown that if G has maximum degree d, then A(G) = 0(d4/3) as d → ∞, which settles a problem of Erdos who conjectured, in 1976, that A( G) = o(d2) as d →∞.

On tree width, bramble size, and expansion

Acyclic colorings of planar graphs

A coloring of the vertices of a graph byk colors is called acyclic provided that no circuit is bichromatic. We prove that every planar graph has an acyclic coloring with nine colors, and conjecture

Dynamic Programming on Graphs with Bounded Treewidth

For several NP-complete problems, and subclasses of the graphs with bounded treewidth, polynomial algorithms have been obtained.

Forbidden minors characterization of partial 3-trees

Linear-programming design and analysis of fast algorithms for Max 2-CSP