Maximum number of colors: C-coloring and related problems

DOI10.1007/S00022-011-0082-2MaRDI QIDQ408951zbMATH OpenOpenAlexWikidataFDO

Authors 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) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Recommendations

• On the max coloring problem
• On the Max Coloring Problem
• On the maximum number of colorings of a graph
• Maximizing the number of q -colorings
• The Maximum k-Colorable Subgraph Problem and Related Problems
• The maximum \(k\)-differential coloring problem
• Maximizing proper colorings on graphs
• Coloring the Maximal Cliques of Graphs
• Maximum number of colors in hypertrees of bounded degree
• Bounded max-colorings of graphs

Cites work

• scientific article; zbMATH DE number 43754 (Why is no real title available?)
• scientific article; zbMATH DE number 1933066 (Why is no real title available?)
• scientific article; zbMATH DE number 786134 (Why is no real title available?)
• 3-consecutive C-colorings of graphs
• 3-consecutive edge coloring of a graph
• 3-consecutive vertex coloring of a graph
• A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2
• About the upper chromatic number of a co-hypergraph
• C-perfect hypergraphs
• Color-bounded hypergraphs, III: model comparison
• Coloring mixed hypergraphs: theory, algorithms and applications
• Improper C-colorings of graphs
• Logarithmic upper bound for the upper chromatic number of \(S(t,t+1,v)\) systems
• Mixed interval hypergraphs
• On restricted colourings of \(K_ n\)
• On stable cutsets in line graphs
• On the minimum size of tight hypergraphs
• Rainbow generalizations of Ramsey theory: A survey
• Smallest set-transversals of \(k\)-partitions
• Strict colorings of Steiner triple and quadruple systems: A survey
• Strict colouring for classes of Steiner triple systems
• The complexity of the matching-cut problem for planar graphs and other graph classes
• The size of minimum 3-trees
• Un Probleme De Coloration Aux Aspects Varies
• Upper chromatic number of Steiner triple and quadruple systems
• Upper chromatic number of finite projective planes
• Vertex coloring without large polychromatic stars
• Voloshin's conjecture for C-perfect hypertrees

Cited in

(6)

• Maximum number of colors in hypertrees of bounded degree
• Mixed hypergraphs and beyond
• Maximizing the number of q -colorings
• Approximability of the upper chromatic number of hypergraphs
• Maximizing the number of unused colors in the vertex coloring problem
• \(K_3\)-WORM colorings of graphs: lower chromatic number and gaps in the chromatic spectrum

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q408951)