On \(b\)-coloring of powers of hypercubes
From MaRDI portal
Publication:528557
DOI10.1016/j.dam.2017.03.005zbMath1361.05048OpenAlexW2605605118MaRDI QIDQ528557
Publication date: 12 May 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2017.03.005
Related Items (3)
The upper domatic number of powers of graphs ⋮ b-coloring of some powers of hypercubes ⋮ \(b\)-coloring of the Mycielskian of some classes of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Bounds for the \(b\)-chromatic number of \(G-v\)
- On a hypercube coloring problem
- Chromatic sets of power graphs and their application to resource placement in multicomputer networks
- The b-chromatic number of a graph
- A coloring problem on the \(n\)-cube
- Perfect elimination orderings of chordal powers of graphs
- Some bounds for the \(b\)-chromatic number of a graph
- New bounds on a hypercube coloring problem.
- \(b\)-chromatic numbers of powers of paths and cycles
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- The b-chromatic number of power graphs of complete caterpillars
- Intersection theorems for systems of finite sets
- On a combinatorial conjecture of Erdös
This page was built for publication: On \(b\)-coloring of powers of hypercubes