# 3-consecutive C-colorings of graphs

@article{Bujts20103consecutiveCO, title={3-consecutive C-colorings of graphs}, author={Csilla Bujt{\'a}s and Charles Dominic and E. Sampathkumar and M. S. Subramanya and Zsolt Tuza}, journal={Discuss. Math. Graph Theory}, year={2010}, volume={30}, pages={393-405} }

A 3-consecutive C-coloring of a graph G = (V;E) is a mapping ’ : V !N such that every path on three vertices has at most two colors. We prove general estimates on the maximum number „ ´3CC(G) of colors in a 3-consecutive C-coloring of G, and characterize the structure of connected graphs with „ ´3CC(G) ‚ k for k = 3 and k = 4.

## 17 Citations

### Vertex Colorings without Rainbow Subgraphs

- MathematicsDiscuss. Math. Graph Theory
- 2016

The F-upper chromatic number of G is defined as the maximum number of colors that can be used to color the vertices of G such that there is no rainbow copy of F such that its vertices receive distinct colors.

### When the vertex coloring of a graph is an edge coloring of its line graph - a rare coincidence

- MathematicsArs Comb.
- 2016

For graphs G of minimum degree at least 2, denoting by L(G) the line graph of G, it is proved that there is a bijection between the 3-consecutive vertex colorings of G and the3- Consecutive edge coloring of L, which keeps the number of colors unchanged, too.

### Worm Colorings

- MathematicsDiscuss. Math. Graph Theory
- 2015

This work defines an F-WORM coloring of G as a coloring of the vertices of G without a rainbow or monochromatic subgraph H isomorphic to F, and presents some results on this concept especially as regards to the existence, complexity, and optimization within certain graph classes.

### Vertex Colorings without Rainbow or Monochromatic Subgraphs

- Mathematics
- 2016

This paper investigates vertex colorings of graphs such that some rainbow subgraph~$R$ and some monochromatic subgraph $M$ are forbidden. Previous work focussed on the case that $R=M$. Here we…

### Coloring subgraphs with restricted amounts of hues

- Mathematics
- 2017

Abstract 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…

### WORM Colorings of Planar Graphs

- MathematicsDiscuss. Math. Graph Theory
- 2017

It is proved that any 3-connected plane graph (respectively outerplane graph) admits a 2-coloring such that no facial path on five (respective four) vertices is monochromatic.

### ℱ-WORM colorings of some 2-trees: partition vectors

- MathematicsArs Math. Contemp.
- 2019

It is shown that, although 2 -trees admit the same partition vector in classic proper vertex colorings which forbid monochrome K 2 , their partition vectors in K 3 -WORM colorings are different.

### Neighborhood-Restricted Achromatic Colorings of Graphs

- Mathematics
- 2016

Neighborhood-Restricted Achromatic Colorings of Graphs by James D. Chandler Sr. A (closed) neighborhood-restricted [≤ 2]-coloring of a graph G is an assignment of colors to the vertices of G such…

## References

SHOWING 1-10 OF 20 REFERENCES

### 3-consecutive vertex coloring of a graph

- Mathematics
- 2010

The 3-consecutive achromatic number of a graph G=(V,E), denoted ψ3c(G), equals the maximum number of colors that can be used in a coloring of the vertices of G such that if uv and vw are any two…

### The mixed hypergraphs

- MathematicsComput. Sci. J. Moldova
- 1993

The notion of an anti-edge of a hypergraph, which is a non-overall polychromatic subset of vertices, is introduced, and the general algorithm for computing the numbers of all colorings of mixed (containing edge andAnti-edge sets) hypergraphs is proposed.

### Algorithmic Aspects of Neighborhood Numbers

- MathematicsSIAM J. Discret. Math.
- 1993

It is shown that these four problems are NP-complete in split graphs with degree constraints and linear time algorithms for them are given in a strongly chordal graph when a strong elimination order is given.

### Color-bounded hypergraphs, II: Interval hypergraphs and hypertrees

- MathematicsDiscret. Math.
- 2009

### 3-consecutive C-colorings of Graphs

- 3-consecutive C-colorings of Graphs

### Walikar, The connected domination number of a graph

- J. Math. Phys. Sci
- 1979

### A new combinatorial parameter

- Colloq. Math. Soc. J. Bolyai
- 1973