Coloring subgraphs with restricted amounts of hues

• Autorzy: Wayne Goddard , Robert Melville
• Języki publikacji: EN

Abstrakty

EN

We consider vertex colorings where the number of colors given to specified subgraphs is restricted. In particular, given some fixed graph F and some fixed set A of positive integers, we consider (not necessarily proper) colorings of the vertices of a graph G such that, for every copy of F in G, the number of colors it receives is in A. This generalizes proper colorings, defective coloring, and no-rainbow coloring, inter alia. In this paper we focus on the case that A is a singleton set. In particular, we investigate the colorings where the graph F is a star or is 1-regular.

Słowa kluczowe

EN

Vertex colorings; Rainbow; Monochromatic; Defective

Kategorie tematyczne

• 05C15: Coloring of graphs and hypergraphs

• Wydawca: De Gruyter Open
• Czasopismo: Open Mathematics
• Rocznik: 2017
• Tom: 15
• Numer: 1
• Strony: 1171-1180

Daty

wydano

2017-01-01

otrzymano

2016-09-02

zaakceptowano

2017-08-17

online

2017-09-22

Twórcy

autor

Wayne Goddard

• , , ,

autor

Robert Melville

• , , ,

Identyfikatory

DOI

10.1515/math-2017-0098