Improper C-colorings of graphs

DOI10.1016/J.DAM.2010.11.004zbMath1210.05037OpenAlexW2089501305WikidataQ59072620 ScholiaQ59072620MaRDI QIDQ629357

Zsolt Tuza, Csilla Bujtás, R. C. Vasundhara, E. Sampathkumar, L. Pushpa Latha

Publication date: 9 March 2011

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2010.11.004

zbMATH Keywords

upper chromatic number3-consecutive coloring\(k\)-improper C-coloringedge cutgraph improper coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Maximum number of colors: C-coloring and related problems ⋮ Vertex coloring without large polychromatic stars ⋮ 3-consecutive edge coloring of a graph ⋮ 3-Sequent achromatic sum of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient algorithms for decomposing graphs under degree constraints
• Matching cutsets in graphs of diameter 2
• Satisfactory graph partition, variants, and generalizations
• The neighbourhood number of a graph
• Parallel concepts in graph theory
• On stable cutsets in line graphs
• Coloring mixed hypergraphs: theory, algorithms and applications
• On Complementary Graphs
• Recognizing decomposable graphs
• The complexity of the matching-cut problem for planar graphs and other graph classes
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• On decomposition of triangle-free graphs under degree constraints
• Algorithms and Computation

This page was built for publication: Improper C-colorings of graphs