Graphs which have \(n/2\)-minimal line-distinguishing colourings

DOI10.1016/0012-365X(94)00365-PzbMath0858.05043MaRDI QIDQ1923477

B. E. Brunton, Brian J. Wilson, Terry S. Griggs

Publication date: 23 March 1997

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

zbMATH Keywords

diametercoloringdegree sequence

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

The edge-distinguishing chromatic number of petal graphs, chorded cycles, and spider graphs ⋮ Distance-regular graphs, MH-colourings and MLD-colourings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Graphs which have \(n/2\)-minimal line-distinguishing colourings