HAL (France)
open access
Bounds for B-coloring planar and outerplanar graphs
A proper coloring of the edges of a graph is one in which every $K_{1,2}$ is totally multicolored. A $B$-coloring is a coloring of the edges of $G$ in which every $K_{1,2}$ and every $K_{2,2}$ is totally multicolored. In this paper, we improve two results by the authors and Gyárfás. The first shows
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
- Proper edge colorings of planar graphs with rainbow $C_4$-s#793392
- Proper edge colorings of planar graphs with rainbow $C_4$-s#789388
- B-coloring of $K_{2,t}$-free planar graphs#1070014
- Strong edge coloring of graphs with maximum degree $6$#1119018
- An improved lower bound for the van der Waerden number $w(3,k)$#1115754
Record · ID 818487
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