Improper C-colorings of graphs
type: Item
instance of: scholarly article
title: Improper C-colorings of graphs
zbMATH Open document ID: 1210.05037
author: Csilla Bujtás
author: E. Sampathkumar
author: Zsolt Tuza
author: R. C. Vasundhara
author: L. Pushpalatha
published in: Discrete Applied Mathematics
publication date: 2011-03-09T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 5862854
zbMATH Keywords: graph improper coloring
zbMATH Keywords: \(k\)-improper C-coloring
zbMATH Keywords: 3-consecutive coloring
zbMATH Keywords: upper chromatic number
zbMATH Keywords: edge cut
MaRDI profile type: Publication
full work available at URL: j.dam.2010.11.004
OpenAlex ID: W2089501305
Wikidata QID: Q59072620
cites work: Algorithms and Computation
cites work: Efficient algorithms for decomposing graphs under degree constraints
cites work: Satisfactory graph partition, variants, and generalizations
cites work: The complexity of the matching-cut problem for planar graphs and other graph classes
cites work: Matching cutsets in graphs of diameter 2
cites work: Recognizing decomposable graphs
cites work: Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
cites work: Q3270978
cites work: Parallel concepts in graph theory
cites work: On decomposition of triangle-free graphs under degree constraints
cites work: On stable cutsets in line graphs
cites work: On Complementary Graphs
cites work: The neighbourhood number of a graph
cites work: Q3012400
cites work: Q3895508
cites work: Q4715286
cites work: Coloring mixed hypergraphs: theory, algorithms and applications
DOI: 10.1016/J.DAM.2010.11.004
description: scientific article; zbMATH DE number 5862854