Vertex-distinguishing edge-colorings of 2-regular graphs

DOI10.1016/S0166-218X(97)00048-6zbMath0882.05064MaRDI QIDQ1373171

P. Wittmann

Publication date: 18 November 1997

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

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

Steiner triple system2-regular graphirregular coloring number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Triple systems (05B07) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Decompositions of pseudographs into closed trails of even sizes

Cites Work

• A direct method to construct triple systems
• Irregular Assignments of Trees and Forests
• A survey: Recent results, conjectures, and open problems in labeling graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Vertex-distinguishing edge-colorings of 2-regular graphs