Equitable colorings of non-uniform simple hypergraphs

DOI10.1016/J.ENDM.2015.06.094zbMATH Open1346.05084OpenAlexW2172608070MaRDI QIDQ322355FDOQ322355

Authors: Irina Shirgazina 

Publication date: 14 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2015.06.094

Recommendations

• Equitable colorings of nonuniform hypergraphs
• Equitable colorings of hypergraphs with \(r\) colors
• Equitable colorings of hypergraphs with few edges
• Around Erdős-Lovász problem on colorings of non-uniform hypergraphs
• Equitable Coloring ofk-Uniform Hypergraphs

zbMATH Keywords

hypergraphscolouringsproperty B

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems
• Improved bounds and algorithms for hypergraph 2-coloring
• On 3-chromatic hypergraphs
• Coloring non-uniform hypergraphs without short cycles

Cited In (12)

• Equitable Coloring ofk-Uniform Hypergraphs
• Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs
• Extremal problems in hypergraph colourings
• Equitable orientations of sparse uniform hypergraphs
• Equitable colorings of nonuniform hypergraphs
• A generalization of the Hajnal-Szemerédi theorem for uniform hypergraphs
• On equitable colorings of hypergraphs
• Equitable colorings of hypergraphs with few edges
• Around Erdős-Lovász problem on colorings of non-uniform hypergraphs
• Equitable coloring of hypergraphs
• A hyperedge coloring and application in combinatorial testing
• Equitable colorings of hypergraphs with \(r\) colors

This page was built for publication: Equitable colorings of non-uniform simple hypergraphs

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