arXiv (All)
open access
Frugal coloring in planar graphs with maximum degree 4 and 5
A proper coloring of vertices of a graph $G$ is called $t$-frugal if no color appears more than $t$ times in the neighborhood of any vertex of $G$. While $1$-frugal coloring coincides with $2$-distance coloring, we study $2$-frugal colorings of planar graphs with maximum degree $4$ and $5$, respecti
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
- Greedy Coloring and Simple Exponential Strengthenings of Brooks-Type Theorems#1325270
- The Four Color Theorem with Linearly Many Reducible Configurations and Near-Linear Time Coloring#1186427
- Conflict-Free Coloring Planar Graphs with 4 Colors#615074
- Conflict-Free Coloring Planar Graphs with 4 Colors#614107
- The maximum number of edges in minimal matching covered graphs#1105537
Record · ID 1296647
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