Computing the automorphic chromatic index of certain snarks

DOI10.1007/S00025-010-0051-3zbMath1216.05032OpenAlexW2034469567MaRDI QIDQ606388

Giuseppe Mazzuoccolo, Carla Fiori, Beatrice Ruini

Publication date: 17 November 2010

Published in: Results in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00025-010-0051-3

zbMATH Keywords

automorphismedge-coloringsnark

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Upper bounds for the automorphic chromatic index of a graph

Cites Work

• On the automorphic chromatic index of a graph
• Infinite classes of dihedral snarks
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing the automorphic chromatic index of certain snarks