The excessive [3]-index of all graphs.
Cariolaro, David, Fu, Hung-Lin (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “On a problem of R. Häggkvist concerning edge-colourings of graphs”
The excessive [3]-index of all graphs.
Partitions and edge colourings of multigraphs.
Kostochka, Alexandr V., Stiebitz, Michael (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Acyclic chromatic index of a subdivided graph
Jozef Fiamčík (1984)
Archivum Mathematicum
Similarity:
Equitable colorations of graphs
D. de Werra (1971)
ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique
Similarity:
Acyclic chromatic index of a graph with maximum valency three
Jozef Fiamčík (1980)
Archivum Mathematicum
Similarity: