arXiv (All)
open access
From b-Coloring to $b^*$-Coloring: Large Girth and Parameterized Complexity
A b-coloring is a proper vertex coloring such that every color class contains a vertex, a so-called b-vertex, which sees all colors in its closed neighborhood. This type of coloring has been intensively studied from both structural and algorithmic point of view. Recently, Zaker [DAM 2025] introduced
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#797617
- Genetic Algorithm for Graph Colouring: Exploration of Galinier and Hao's algorithm#824270
- Defective chromatic polynomials#1118544
- Strong edge coloring of graphs with maximum degree $6$#1119018
- Determining a graph from its reconfiguration graph#927125
Record · ID 799032
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