The \(b\)-chromatic number of powers of hypercube

DOI10.1016/j.endm.2016.05.039zbMath1347.05063OpenAlexW2515637701MaRDI QIDQ327695

Mohammad Hasan, M. Dambrine

Publication date: 19 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2016.05.039

zbMATH Keywords

hypercubespower of a graph\(b\)-coloring\(b\)-chromatic number

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• The b-chromatic number of power graphs of complete caterpillars
• On a combinatorial conjecture of Erdös