The lexicographic product of some chordal graphs and of cographs preserves b-continuity
From MaRDI portal
Publication:2413181
DOI10.1016/J.ENDM.2017.10.045zbMATH Open1383.05273OpenAlexW2766376282MaRDI QIDQ2413181FDOQ2413181
Authors: Yanyan Li
Publication date: 9 April 2018
Full work available at URL: https://doi.org/10.1016/j.endm.2017.10.045
Recommendations
Cites Work
- Graph theory
- Graph Classes: A Survey
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- The b-chromatic number of a graph
- \(b\)-coloring of tight graphs
- On the \(b\)-continuity property of graphs
- Title not available (Why is that?)
- S-functions for graphs
- On the b-coloring of cographs and \(P_{4}\)-sparse graphs
- On the b-chromatic number of some graph products
- \(b\)-continuity and the lexicographic product of graphs
- About the b-continuity of graphs
- On the \(b\)-coloring of \(P_{4}\)-tidy graphs
- A characterisation of rigid circuit graphs
- On \(b\)-coloring of the Kneser graphs
- On \(b\)-continuity of Kneser graphs of type \(\mathrm{KG}(2k+1,k)\).
- The \(b\)-chromatic index of graphs
- \(b\)-coloring of Kneser graphs
- The \(b\)-continuity of graphs with large girth
- On the \(b\)-continuity of the lexicographic product of graphs
Cited In (2)
This page was built for publication: The lexicographic product of some chordal graphs and of cographs preserves \(b\)-continuity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2413181)