The \(b\)-chromatic index of direct product of graphs
From MaRDI portal
Publication:2352788
DOI10.1016/j.dam.2015.04.003zbMath1316.05047OpenAlexW2043651615MaRDI QIDQ2352788
Publication date: 6 July 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.04.003
Related Items (5)
Thinness of product graphs ⋮ The \(b\)-chromatic number and related topics -- a survey ⋮ An integer programming approach to b-coloring ⋮ Upper and lower bounds based on linear programming for the b-coloring problem ⋮ A matheuristic approach for the \(b\)-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounds for the \(b\)-chromatic number of \(G-v\)
- \(b\)-colouring outerplanar graphs with large girth
- Hybrid evolutionary algorithm for the b-chromatic number
- The b-chromatic number of cubic graphs
- On the \(b\)-coloring of \(P_{4}\)-tidy graphs
- A quasicancellation property for the direct product of 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
- On approximating the b-chromatic number
- Some bounds for the \(b\)-chromatic number of a graph
- On the \(b\)-chromatic number of regular graphs
- On the \(b\)-continuity property of graphs
- Bounds for the b-chromatic number of some families of graphs
- On the \(b\)-dominating coloring of graphs
- b-chromatic number of cacti
- On the b-chromatic number of some graph products
- The Kronecker Product of Graphs
- The b-chromatic number of power graphs of complete caterpillars
- Exact values for theb-chromatic number of a power completek-ary tree
- The b -chromatic number of the cartesian product of two graphs
This page was built for publication: The \(b\)-chromatic index of direct product of graphs
