Opuscula Math. 24, no. 2 (2004), 223-229

Opuscula Mathematica

A note on the vertex-distinguishing index for some cubic graphs

Karolina Taczuk
Mariusz Woźniak

Abstract. The vertex-distinguishing index of a graph \(G\) (\(\operatorname{vdi}(G)\)) is the minimum number of colours required to colour properly the edges of a graph in such a way that any two vertices are incident with different sets of colours. We consider this parameter for some families of cubic graphs.

Keywords: edge colouring, vertex-distinguishing colouring, cubic graphs.

Mathematics Subject Classification: 05C15.

Full text (pdf)

  • Karolina Taczuk
  • School of Economics and Computer Science, ul. Św. Filipa 17, 31-150 Cracow, Poland
  • Mariusz Woźniak
  • AGH University of Science and Technology, Faculty of Applied Mathematics, al. Mickiewicza 30, 30-059 Cracow, Poland
  • Received: 2004-07-13.
Opuscula Mathematica - cover

Cite this article as:
Karolina Taczuk, Mariusz Woźniak, A note on the vertex-distinguishing index for some cubic graphs, Opuscula Math. 24, no. 2 (2004), 223-229

Download this article's citation as:
a .bib file (BibTeX),
a .ris file (RefMan),
a .enw file (EndNote)
or export to RefWorks.

In accordance with EU legislation we advise you this website uses cookies to allow us to see how the site is used. All data is anonymized.
All recent versions of popular browsers give users a level of control over cookies. Users can set their browsers to accept or reject all, or certain, cookies.