Computing the automorphic chromatic index of certain snarks

DOI10.1007/S00025-010-0051-3MaRDI QIDQ606388zbMATH OpenOpenAlexFDO

Authors Carla Fiori, G. Mazzuoccolo, B. 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

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

Recommendations

• On the automorphic chromatic index of a graph
• Automorphic chromatic index of generalized Petersen graphs
• Upper bounds for the automorphic chromatic index of a graph
• Infinite classes of dihedral snarks
• A note on Nordhaus-Gaddum-type inequalities for the automorphic \(\mathcal{H}\)-chromatic index of graphs

Cites work

• scientific article; zbMATH DE number 1232919 (Why is no real title available?)
• scientific article; zbMATH DE number 227006 (Why is no real title available?)
• Infinite classes of dihedral snarks
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• On the automorphic chromatic index of a graph

Cited in

(6)

• A note on Nordhaus-Gaddum-type inequalities for the automorphic \(\mathcal{H}\)-chromatic index of graphs
• On the automorphic chromatic index of a graph
• Automorphic chromatic index of generalized Petersen graphs
• (d,1)-total labellings of two infinite families of snarks
• Upper bounds for the automorphic chromatic index of a graph
• Infinite classes of dihedral snarks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q606388)