Equitable colorings of nonuniform hypergraphs
From MaRDI portal
Publication:325641
DOI10.1134/S0001434616030147zbMATH Open1347.05080OpenAlexW2401625409MaRDI QIDQ325641FDOQ325641
Authors: I. R. Shirgazina 
Publication date: 18 October 2016
Published in: Mathematical Notes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0001434616030147
Recommendations
Extremal problems in graph theory (05C35) 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
- On a property of families of sets
- Title not available (Why is that?)
- Using Lovász local lemma in the space of random injections
- On 3-chromatic hypergraphs
- Around Erdős-Lovász problem on colorings of non-uniform hypergraphs
- Equitable two-colorings of uniform hypergraphs
- Color-critical graphs and hypergraphs with few edges: a survey
- On a combinatorial problem. II
- Coloring non-uniform hypergraphs without short cycles
Cited In (14)
- Equitable Coloring ofk-Uniform Hypergraphs
- Equitable hypergraph orientations
- 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
- On almost-regular edge colourings of hypergraphs
- Title not available (Why is that?)
- Equitable colorings of non-uniform simple hypergraphs
- Equitable two-colorings of uniform hypergraphs
- On equitable colorings of hypergraphs
- Equitable colorings of hypergraphs with few edges
- 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 nonuniform hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q325641)
