Concepts on coloring of cluster hypergraphs with application
From MaRDI portal
Publication:2196923
DOI10.1155/2020/3705156zbMath1459.05091OpenAlexW3048226255MaRDI QIDQ2196923
Shah Khalid Khan, Kousik Das, Sovan Samanta, Usman Naseem, Jeong Gon Lee
Publication date: 4 September 2020
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2020/3705156
Applications of graph theory (05C90) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (2)
Fuzzy chordal graphs and its properties ⋮ Fuzzy resolving number and real basis generating fuzzy graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
- Edge-coloring of 3-uniform hypergraphs
- A mathematical approach on representation of competitions: competition cluster hypergraphs
- Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász
- On 3-chromatic hypergraphs
- On 2-coloring certain \(k\)-uniform hypergraphs
- Competition hypergraphs
- A characterization of cube-hypergraphs
- Sum numbers of hypertrees
- Polychromatic colorings and cover decompositions of hypergraphs
- Every 8-uniform 8-regular hypergraph is 2-colorable
- Complete colourings of hypergraphs
- Equitable colorings of hypergraphs with few edges
- Equitable coloring of hypergraphs
- DP-colorings of hypergraphs
- Coloring mixed hypertrees
- Colour-critical graphs and hypergraphs
- Coloring bipartite hypergraphs
- On chromatic number of graphs and set-systems
- Approximation and Online Algorithms
This page was built for publication: Concepts on coloring of cluster hypergraphs with application