arXiv (All)
open access
A variety of the mutual-visibility coloring problem for graphs
This paper explores variations of vertex-coloring problems defined on graph visibility properties. It introduces and studies the dual, outer, and total mutual-visibility chromatic numbers, which partition the vertex set of a graph into color classes that preserve specific mutual-visibility condition
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
- Distributed $(Δ+1)$-Coloring in Graphs of Bounded Neighborhood Independence#924468
- Distributed $(Δ+1)$-Coloring in Graphs of Bounded Neighborhood Independence#920237
- Contribution à l'étude de quelques problèmes de coloration de graphes#370924
- Graph Coloring with Color Preferences#820007
- Variations on the graph colouring problem#624742
Record · ID 1106126
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