On the \(b\)-continuity of the lexicographic product of graphs
From MaRDI portal
Publication:1684933
DOI10.1007/s00373-017-1832-1zbMath1386.05164arXiv1610.03084OpenAlexW2530831088MaRDI QIDQ1684933
Publication date: 12 December 2017
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.03084
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(b\)-continuity and the lexicographic product of graphs
- On the \(b\)-coloring of \(P_{4}\)-tidy graphs
- An introduction to timetabling
- \(b\)-coloring of Kneser graphs
- On the b-coloring of cographs and \(P_{4}\)-sparse graphs
- On \(b\)-coloring of the Kneser graphs
- The b-chromatic number of a graph
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- The \(b\)-continuity of graphs with large girth
- \(b\)-coloring of tight graphs
- The chromatic number and other functions of the lexicographic product
- Linear time optimization algorithms for \(P_ 4\)-sparse graphs
- Graphs of girth at least 7 have high \(b\)-chromatic number
- The \(b\)-chromatic index of graphs
- On the \(b\)-continuity property of graphs
- Incidence matrices and interval graphs
- Upper bounds on the b-chromatic number and results for restricted graph classes
- On the b-chromatic number of some graph products
- About the b-continuity of graphs
- The NP-Completeness of Edge-Coloring
- On the two‐edge‐colorings of perfect graphs
This page was built for publication: On the \(b\)-continuity of the lexicographic product of graphs