arXiv (OAI Expanded)
open access
Strong Conflict-Free Vertex-Connection via Twin Cover: Kernelization and Chromatic Bounds
A vertex-coloring of a connected graph $G$ is a strong conflict-free vertex-connection coloring if every two distinct vertices are joined by a shortest path on which some color appears exactly once. The minimum number of colors in such a coloring is the strong conflict-free vertex-connection number
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
- Strong Conflict-Free Vertex-Connection via Twin Cover: Kernelization and Chromatic Bounds#819369
- A note on the multicolor size-Ramsey numbers of connected graphs#128283
- Quandle coloring quivers of pretzel links#1077056
- Rainbow paths in directed graphs#974805
- The Burness-Giudici Conjecture on Primitive Groups with Socle $Ree(q)$ and $Sz(q)$#1070741
Record · ID 809376
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