Maximum number of colors: C-coloring and related problems
type: Item
instance of: scholarly article
title: Maximum number of colors: C-coloring and related problems
zbMATH Open document ID: 1238.05086
author: Csilla Bujtás
author: Zsolt Tuza
published in: Journal of Geometry
publication date: 2012-04-12T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05B05
zbMATH DE Number: 6023279
zbMATH Keywords: hypergraph coloring
zbMATH Keywords: C-coloring
zbMATH Keywords: partition crossing
zbMATH Keywords: C-perfect hypergraph
zbMATH Keywords: Steiner system
zbMATH Keywords: finite projective plane
zbMATH Keywords: 3-consecutive coloring
Wikidata QID: Q59072632
MaRDI profile type: Publication
full work available at URL: s00022-011-0082-2
OpenAlex ID: W2059416008
cites work: On the minimum size of tight hypergraphs
cites work: The size of minimum 3-trees
cites work: Upper chromatic number of finite projective planes
cites work: Q3993087
cites work: The complexity of the matching-cut problem for planar graphs and other graph classes
cites work: 3-consecutive C-colorings of graphs
cites work: 3-consecutive edge coloring of a graph
cites work: Vertex coloring without large polychromatic stars
cites work: Improper C-colorings of graphs
cites work: Q3649378
cites work: Smallest set-transversals of \(k\)-partitions
cites work: C-perfect hypergraphs
cites work: Q3001210
cites work: Mixed interval hypergraphs
cites work: Rainbow generalizations of Ramsey theory: A survey
cites work: A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2
cites work: About the upper chromatic number of a co-hypergraph
cites work: Q4405654
cites work: On stable cutsets in line graphs
cites work: Upper chromatic number of Steiner triple and quadruple systems
cites work: Strict colouring for classes of Steiner triple systems
cites work: Q3011760
cites work: Strict colorings of Steiner triple and quadruple systems: A survey
cites work: Q3012400
cites work: On restricted colourings of \(K_ n\)
cites work: Un Probleme De Coloration Aux Aspects Varies
cites work: Q4842710
cites work: Coloring mixed hypergraphs: theory, algorithms and applications
DOI: 10.1007/S00022-011-0082-2
Recommended article: On the max coloring problem
Recommended article: On the Max Coloring Problem
Recommended article: On the maximum number of colorings of a graph
Recommended article: Maximizing the number of q -colorings
Recommended article: The Maximum k-Colorable Subgraph Problem and Related Problems
Recommended article: The maximum \(k\)-differential coloring problem
Recommended article: Maximizing proper colorings on graphs
Recommended article: Coloring the Maximal Cliques of Graphs
Recommended article: Maximum number of colors in hypertrees of bounded degree
Recommended article: Bounded max-colorings of graphs
description: scientific article; zbMATH DE number 6023279