arXiv (All)
open access
Arc-distinguishing of orientations of graphs
The distinguishing index $D'(G)$ of a graph $G$ is the minimum number of colours in an edge colouring preserved only by the identity automorphism. We study how orienting the edges affects this parameter, relating the minimum and maximum distinguishing indices over all orientations of $G$ to $D'(G)$.
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
- Edge-coloring problems with forbidden patterns and planted colors#177099
- The Statistical Analysis of Complexity and Regularity of Colour Information in Paintings#69567
- AVD Total Colorings of Subdivision Graphs, Joins, and Deleted Lexicographic Products#618143
- AVD Total Colorings of Subdivision Graphs, Joins, and Deleted Lexicographic Products#617643
- Global patterns in signed permutations#1110087
Record · ID 997906
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