Some results on the b-chromatic number in complementary prism graphs
From MaRDI portal
Publication:5244296
DOI10.1051/ro/2018054zbMath1425.05052OpenAlexW2810579261MaRDI QIDQ5244296
Noureddine Ikhlef Eschouf, Mostafa Blidia, Amel Bendali-Braham
Publication date: 20 November 2019
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ro/2018054
Related Items (5)
A note on the convexity number of the complementary prisms of trees ⋮ COMPUTATION OF b-CHROMATIC TOPOLOGICAL INDICES OF SOME GRAPHS AND ITS DERIVED GRAPHS ⋮ Geometric and topological properties of the complementary prism networks ⋮ Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs ⋮ Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs
Cites Work
- \(b\)-colouring outerplanar graphs with large girth
- The b-chromatic number of cubic graphs
- \(b\)-coloring of Kneser graphs
- Domination and total domination in complementary prisms
- On the b-chromatic number of Kneser graphs
- On \(b\)-colorings in regular graphs
- On \(b\)-coloring of the Kneser graphs
- The b-chromatic number of a graph
- The \(b\)-chromatic number and related topics -- a survey
- \(b\)-colouring the Cartesian product of trees and some other graphs
- \(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture
- b-coloring of m-tight graphs
- b-chromatic number of cacti
- On the b-chromatic number of some graph products
- The b-chromatic number of power graphs of complete caterpillars
- Exact values for theb-chromatic number of a power completek-ary tree
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Some results on the b-chromatic number in complementary prism graphs