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
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 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

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

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off