On the automorphic chromatic index of a graph
From MaRDI portal
Publication:604996
DOI10.1007/s00373-010-0923-zzbMath1221.05138OpenAlexW2092921872MaRDI QIDQ604996
Giuseppe Mazzuoccolo, Beatrice Ruini, Carla Fiori
Publication date: 12 November 2010
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-010-0923-z
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
Computing the automorphic chromatic index of certain snarks ⋮ Upper bounds for the automorphic chromatic index of a graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The distinguishing chromatic number
- On finite edge-primitive and edge-quasiprimitive graphs
- Methods of destroying the symmetries of a graph
- Symmetry breaking in graphs
- Chromatic automorphisms of graphs
- Farb- und zerlegungstreue Automorphismen von Graphen
- One-Factorizations of Complete Graphs with a Doubly Transitive Automorphism Group
- Remarkable Groups of Graphs with Edge Colourings