Seznamsko krepko in seznamsko normalno barvanje povezav subkubičnih grafov

DiRROS repository (University of Maribor) 2026 Open access

Read full text
Authors: Borut Lužar, Edita Máčajová, Roman Soták, Diana Švecová
Cited by: 0

Abstract

A ▫${ strong edge-coloring}$▫ of a graph is a proper edge-coloring, in which the edges of every path of length ▫$3$▫ receive distinct colors

Fields of Study & Subjects

Graph Labeling and Dimension Problems Advanced Graph Theory Research Finite Group Theory Research

Publication details

Journal / source
DiRROS repository (University of Maribor)
Publication date
1 January 2026
Language
EN