Vertex coloring without large polychromatic stars
type: Item
instance of: scholarly article
title: Vertex coloring without large polychromatic stars
zbMATH Open document ID: 1244.05088
author: Csilla Bujtás
author: E. Sampathkumar
author: Zsolt Tuza
author: Charles Dominic
author: L. Pushpalatha
published in: Discrete Mathematics
publication date: 2012-07-04T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6053069
zbMATH Keywords: graph coloring
zbMATH Keywords: vertex coloring
zbMATH Keywords: local condition
zbMATH Keywords: upper chromatic number
zbMATH Keywords: \(C\)-coloring
Wikidata QID: Q59072599
MaRDI profile type: Publication
full work available at URL: j.disc.2011.04.013
OpenAlex ID: W2081018322
cites work: Improper C-colorings of graphs
cites work: 3-consecutive C-colorings of graphs
cites work: Parallel concepts in graph theory
cites work: The neighbourhood number of a graph
cites work: Q3012400
cites work: Q3895508
DOI: 10.1016/J.DISC.2011.04.013
Recommended article: Edge-colorings with no large polychromatic stars
Recommended article: Vertex-Coloring with Star-Defects
Recommended article: Edge colorings of graphs without monochromatic stars
Recommended article: On vertex coloring without monochromatic triangles
Recommended article: A polyhedral investigation of star colorings
Recommended article: Q5076577
Recommended article: Vertex Colorings without Rainbow or Monochromatic Subgraphs
Recommended article: Vertex colorings without rainbow subgraphs
Recommended article: Q4448754
Recommended article: Star coloring of graphs
description: scientific article; zbMATH DE number 6053069