Upper bounds for the automorphic chromatic index of a graph
From MaRDI portal
Publication:742607
DOI10.1007/s00373-013-1321-0zbMath1298.05128MaRDI QIDQ742607
Beatrice Ruini, Giuseppe Mazzuoccolo
Publication date: 19 September 2014
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-013-1321-0
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
05C15: Coloring of graphs and hypergraphs
05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
Cites Work
- Unnamed Item
- On the automorphic chromatic index of a graph
- Computing the automorphic chromatic index of certain snarks
- Automorphic chromatic index of generalized Petersen graphs
- The distinguishing chromatic number
- Symmetry breaking in graphs
- Chromatic automorphisms of graphs
- The NP-completeness of authomorphic colorings
- Farb- und zerlegungstreue Automorphismen von Graphen
- Remarkable Groups of Graphs with Edge Colourings