scientific article; zbMATH DE number 2192169

zbMATH Open1074.05033MaRDI QIDQ5463545FDOQ5463545

Authors: Gary Chartrand, Varaporn Saenpholphat, Ping Zhang 

Publication date: 4 August 2005

Title of this publication is not available (Why is that?)

Recommendations

• Maximum edge-colorings of graphs
• Measures of edge-uncolorability
• Even edge colorings of a graph
• scientific article; zbMATH DE number 4095491
• scientific article; zbMATH DE number 6837036

zbMATH Keywords

distanceresolving decompositionresolving edge chromatic numberresolving edge colouring

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15)

Cited In (3)

• On resolving edge colorings in graphs
• On the locating chromatic number of Kneser graphs
• A bound for the locating chromatic number of trees

This page was built for publication:

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