The fibonacci numbers in edge coloured unicyclic graphs

Authors

  • Bednarz, Natalia
  • Włoch, Andrzej
  • Włoch, Iwona

Abstract

In this paper we give the successive lower bounds for the number of all (i4,25)-edge colourings in unicyclic graphs. Moreover we give characterizations of extremal graphs achieving these successive minimum values. © 2018 Utilitas Mathematica Publishing Inc. All rights reserved.

Published

2018-03-09

How to Cite

Bednarz, Natalia, Włoch, Andrzej, & Włoch, Iwona. (2018). The fibonacci numbers in edge coloured unicyclic graphs. Utilitas Mathematica, 106. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/1358

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.