Solving the b-coloring problem for subdivision-edge neighborhood coronas

DOI10.1142/S179383092350009XzbMATH Open1539.05036MaRDI QIDQ6551192FDOQ6551192

S. Julie Margaret, Venkatachalam, Raúl M. Falcón

Publication date: 6 June 2024

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

cyclecomplete graphpathstar graph\(b\)-coloring problemsubdivision-edge neighborhood corona

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?)
• The b-chromatic number of a graph
• \(b\)-colouring the Cartesian product of trees and some other graphs
• Some bounds for the \(b\)-chromatic number of a graph
• On the b-chromatic number of some graph products
• Spectra of subdivision-vertex and subdivision-edge neighbourhood coronae
• The b -chromatic number of the cartesian product of two graphs
• \(b\)-chromatic number of Cartesian product of some families of graphs
• \(b\)-coloring of Cartesian product of trees
• The \(b\)-chromatic index of direct product of graphs
• On \(b\)-coloring of Cartesian product of graphs.
• The \(b\)-chromatic number and related topics -- a survey
• On the \(b\)-continuity of the lexicographic product of graphs
• On the \(b\)-chromatic number of Cartesian products
• Normalized Laplacian spectrum of some subdivision-coronas of two regular graphs
• Spectra of graphs resulting from various graph operations and products: a survey
• Adjacency and Laplacian spectra of variants of neighborhood corona of graphs constrained by vertex subsets
• On two conjectures on b-coloring of graph products

This page was built for publication: Solving the \(b\)-coloring problem for subdivision-edge neighborhood coronas

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