b-coloring of the Mycielskian of some classes of graphs
From MaRDI portal
Publication:2118233
DOI10.7151/DMGT.2265zbMATH Open1490.05083OpenAlexW2995306839WikidataQ126546240 ScholiaQ126546240MaRDI QIDQ2118233FDOQ2118233
Authors: S. Francis Raj, M. Gokulnath 
Publication date: 22 March 2022
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2265
Recommendations
Cites Work
- Circular chromatic number and a generalization of the construction of Mycielski.
- Sur le coloriage des graphs
- The b-chromatic number of a graph
- On the \(b\)-chromatic number of regular graphs
- Title not available (Why is that?)
- Some bounds for the \(b\)-chromatic number of a graph
- About the b-continuity of graphs
- On \(b\)-coloring of powers of hypercubes
- On \(b\)-coloring of the Kneser graphs
- On \(b\)-continuity of Kneser graphs of type \(\mathrm{KG}(2k+1,k)\).
- Bounds for the \(b\)-chromatic number of the Mycielskian of some families of graphs.
- \(b\)-coloring of Kneser graphs
- \(b\)-chromatic number of Cartesian product of some families of graphs
- \(b\)-coloring of Cartesian product of trees
- The \(b\)-chromatic number and related topics -- a survey
Cited In (6)
- Title not available (Why is that?)
- The \(b\)-chromatic number of some standard graphs
- Bounds for the \(b\)-chromatic number of the Mycielskian of some families of graphs.
- \(b\)-chromatic sum of Mycielskian of paths
- Graphs with large girth are \(b\)-continuous
- \(b\)-coloring of the Mycielskian of regular graphs
This page was built for publication: \(b\)-coloring of the Mycielskian of some classes of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118233)
