Some results on the b-chromatic number in complementary prism graphs

DOI10.1051/RO/2018054zbMATH Open1425.05052OpenAlexW2810579261MaRDI QIDQ5244296FDOQ5244296

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

zbMATH Keywords

\(b\)-coloring\(b\)-chromatic numbercomplementary prism graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The b-chromatic number of a graph
• \(b\)-colouring the Cartesian product of trees and some other graphs
• The b-chromatic number of cubic graphs
• On the b-chromatic number of some graph products
• The b-chromatic number of power graphs of complete caterpillars
• \(b\)-colouring outerplanar graphs with large girth
• On \(b\)-colorings in regular graphs
• On \(b\)-coloring of the Kneser graphs
• Domination and total domination in complementary prisms
• \(B\)-chromatic number of cacti
• Exact values for theb-chromatic number of a power completek-ary tree
• On the b-chromatic number of Kneser graphs
• \(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture
• \(b\)-coloring of Kneser graphs
• The \(b\)-chromatic number and related topics -- a survey
• \(B\)-coloring of \(m\)-tight graphs
• Extendability of the complementary prism of 2-regular graphs

Cited In (6)

• On the bondage, strong and weak bondage numbers in complementary prism graphs
• Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs
• Geometric and topological properties of the complementary prism networks
• 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
• Complexity results on open-independent, open-locating-dominating sets in complementary prism graphs

This page was built for publication: Some results on the b-chromatic number in complementary prism graphs

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