Please use this identifier to cite or link to this item: https://www.um.edu.mt/library/oar/handle/123456789/112879
Title: Voloshin colourings of mixed hypergraphs derived from graphs
Authors: Lauri, Josef
Gionfriddo, Lucia
Keywords: Hypergraphs
Graph theory
Graph coloring
Mathematics -- Charts, diagrams, etc.
Issue Date: 2012
Citation: Josef, L., & Gionfriddo, L. (2012). Voloshin colourings of mixed hypergraphs derived from graphs. Quaderni di Matematica, 28.
Abstract: A mixed hypergraph is a hypergraph with two types of edges. The D hyper-edges must have at least two different colours in any colouring of the vertices of the hypergraph while the C hyperedges must have at least two vertices with a common colour. In this paper I hope to explain how Lucia and I had planned to study the colouring of some hypergraph derived from graphs.
URI: https://www.um.edu.mt/library/oar/handle/123456789/112879
Appears in Collections:Scholarly Works - FacSciMat

Files in This Item:
File Description SizeFormat 
Voloshin_colourings_of_mixed_hypergraphs_derived_from_graphs_2012.pdf
  Restricted Access
118.95 kBAdobe PDFView/Open Request a copy


Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.