arXiv (All)
open access
Proper conflict-free choosability of sparse graphs with girth at least seven
A proper conflict-free coloring is a proper vertex coloring in which every non-isolated vertex has a color appearing exactly once in its open neighborhood. We prove that every finite simple graph with girth at least 7 and maximum average degree less than 8/3 admits a proper conflict-free coloring fr
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
- A Brooks-like result for graph powers $#983875
- Proper Conflict-Free Choosability for Graphs with Bounded Average Degree#794171
- Proper Conflict-Free Choosability for Graphs with Bounded Average Degree#790152
- Parameterized complexity of $k$-Coloring in graphs with no long induced paths#1069883
- Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs#344749
Record · ID 998793
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