arXiv (All)
open access
Finding $b$-colorings Using Feedback Edges
A $b$-coloring of a graph is a proper vertex coloring such that each color class contains a vertex that sees all other colors in its neighborhood. The $b$-coloring problem, in which the task is to decide whether a graph admits a $b$-coloring with $k$ colors, is NP-complete in general but polytime so
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
- From b-Coloring to $b^*$-Coloring: Large Girth and Parameterized Complexity#799032
- From b-Coloring to $b^*$-Coloring: Large Girth and Parameterized Complexity#797617
- A New Method that can Generate Ramsey Colourings for Eight and Thirteen Colours#1063062
- A Polynomially Searchable Exponential Neighbourhood for Graph Colouring#824269
- Determining a graph from its reconfiguration graph#927125
Record · ID 820304
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