b-continuity and the lexicographic product of graphs
From MaRDI portal
Publication:324755
DOI10.1016/J.ENDM.2015.07.024zbMATH Open1347.05166OpenAlexW2219897699MaRDI QIDQ324755FDOQ324755
Authors: Cláudia L. Sales, Rafael Vargas, L. Sampaio
Publication date: 17 October 2016
Full work available at URL: https://doi.org/10.1016/j.endm.2015.07.024
Recommendations
- On the \(b\)-continuity of the lexicographic product of graphs
- Upper bounds on the \(b\)-chromatic number and results for restricted graph classes
- The lexicographic product of some chordal graphs and of cographs preserves \(b\)-continuity
- The \(b\)-coloring and \(b\)-continuity of the cartesian product of some graphs
- The \(b\)-continuity of some special corona graphs
Cites Work
Cited In (8)
- b-coloring of Cartesian product of odd graphs.
- On the \(b\)-continuity property of graphs
- The \(b\)-coloring and \(b\)-continuity of the cartesian product of some graphs
- On the \(b\)-continuity of the lexicographic product of graphs
- The lexicographic product of some chordal graphs and of cographs preserves \(b\)-continuity
- A characterization of edge \(b\)-critical graphs
- \(b\)-coloring of Kneser graphs
- \(b\)-chromatic number of lexicographic product of some graphs
This page was built for publication: \(b\)-continuity and the lexicographic product of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q324755)