Maximum number of colors: C-coloring and related problems

DOI10.1007/s00022-011-0082-2zbMath1238.05086OpenAlexW2059416008WikidataQ59072632 ScholiaQ59072632MaRDI QIDQ408951

Csilla Bujtás, Zsolt Tuza

Publication date: 12 April 2012

Published in: Journal of Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00022-011-0082-2

zbMATH Keywords

Steiner systemfinite projective planeC-coloringhypergraph coloring3-consecutive coloringC-perfect hypergraphpartition crossing

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial aspects of block designs (05B05) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Maximum number of colors in hypertrees of bounded degree ⋮ Mixed hypergraphs and beyond ⋮ \(K_3\)-WORM colorings of graphs: lower chromatic number and gaps in the chromatic spectrum ⋮ Approximability of the upper chromatic number of hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Vertex coloring without large polychromatic stars
• Rainbow generalizations of Ramsey theory: A survey
• Improper C-colorings of graphs
• 3-consecutive edge coloring of a graph
• On restricted colourings of \(K_ n\)
• Smallest set-transversals of \(k\)-partitions
• Mixed interval hypergraphs
• Upper chromatic number of Steiner triple and quadruple systems
• Strict colouring for classes of Steiner triple systems
• On stable cutsets in line graphs
• About the upper chromatic number of a co-hypergraph
• Coloring mixed hypergraphs: theory, algorithms and applications
• Strict colorings of Steiner triple and quadruple systems: A survey
• A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2
• 3-consecutive C-colorings of graphs
• C-perfect hypergraphs
• The size of minimum 3-trees
• Upper chromatic number of finite projective planes
• The complexity of the matching-cut problem for planar graphs and other graph classes
• Un Probleme De Coloration Aux Aspects Varies
• On the minimum size of tight hypergraphs

This page was built for publication: Maximum number of colors: C-coloring and related problems