arXiv (All)
open access
Improved bounds on the b-chromatic number using the independence and chromatic numbers
Finding a minimum proper vertex coloring is $\NP$-hard and hard to approximate. $B$-coloring is used as a heuristic approach to graph coloring. A b-coloring of a graph $G$ is a proper vertex coloring where each color class contains at least one vertex (a b-vertex) adjacent to a vertex in every other
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Bounds for B-coloring planar and outerplanar graphs#818487
- Degeneracy bounds, stability, and a sharp gap for $B$-colorings#924967
- Degeneracy bounds, stability, and a sharp gap for $B$-colorings#920733
- Graph Coloring with Color Preferences#820007
- k-Coloring is Faster than Computing the Chromatic Number#987763
Record · ID 1456264
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive