Thoroughly dispersed colorings

Thoroughly dispersed colorings We consider (not necessarily proper) colorings of the vertices of a graph where every color is thoroughly dispersed, that is, appears in every open neighborhood. Equivalently, every color is a total dominating set. We define td(G) as the maximum number of colors in such a coloring and FTD(G) as the fractional version thereof. In particular, we show that every claw‐free graph with minimum degree at least  two has FTD(G)≥3/2 and this is best possible. For planar graphs, we show that every triangular disc has FTD(G)≥3/2 and this is best possible, and that every planar graph has td(G)≤4 and this is best possible, while we conjecture that every planar triangulation has td(G)≥2. Further, although there are arbitrarily large examples of connected, cubic graphs with td(G)=1, we show that for a connected cubic graph FTD(G)≥2−o(1). We also consider the related concepts in hypergraphs. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of Graph Theory Wiley

Thoroughly dispersed colorings

Loading next page...
 
/lp/wiley/thoroughly-dispersed-colorings-HKWjgteD3e
Publisher
Wiley Subscription Services, Inc., A Wiley Company
Copyright
Copyright © 2018 Wiley Periodicals, Inc.
ISSN
0364-9024
eISSN
1097-0118
D.O.I.
10.1002/jgt.22204
Publisher site
See Article on Publisher Site

Abstract

We consider (not necessarily proper) colorings of the vertices of a graph where every color is thoroughly dispersed, that is, appears in every open neighborhood. Equivalently, every color is a total dominating set. We define td(G) as the maximum number of colors in such a coloring and FTD(G) as the fractional version thereof. In particular, we show that every claw‐free graph with minimum degree at least  two has FTD(G)≥3/2 and this is best possible. For planar graphs, we show that every triangular disc has FTD(G)≥3/2 and this is best possible, and that every planar graph has td(G)≤4 and this is best possible, while we conjecture that every planar triangulation has td(G)≥2. Further, although there are arbitrarily large examples of connected, cubic graphs with td(G)=1, we show that for a connected cubic graph FTD(G)≥2−o(1). We also consider the related concepts in hypergraphs.

Journal

Journal of Graph TheoryWiley

Published: Jan 1, 2018

Keywords: ; ; ; ; ;

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 12 million articles from more than
10,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Unlimited reading

Read as many articles as you need. Full articles with original layout, charts and figures. Read online, from anywhere.

Stay up to date

Keep up with your field with Personalized Recommendations and Follow Journals to get automatic updates.

Organize your research

It’s easy to organize your research with our built-in tools.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

Monthly Plan

  • Read unlimited articles
  • Personalized recommendations
  • No expiration
  • Print 20 pages per month
  • 20% off on PDF purchases
  • Organize your research
  • Get updates on your journals and topic searches

$49/month

Start Free Trial

14-day Free Trial

Best Deal — 39% off

Annual Plan

  • All the features of the Professional Plan, but for 39% off!
  • Billed annually
  • No expiration
  • For the normal price of 10 articles elsewhere, you get one full year of unlimited access to articles.

$588

$360/year

billed annually
Start Free Trial

14-day Free Trial