Colourings of $(m, n)$-coloured mixed graphs

A mixed graph is, informally, an object obtained from a simple undirected graph by choosing an orientation for a subset of its edges. A mixed graph is $(m, n)$-coloured if each edge is assigned one of $m \geq 0$ colours, and each arc is assigned one of $n \geq 0$ colours. Oriented graphs are $(0, 1)...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete mathematics and theoretical computer science Jg. 25:2; H. Graph Theory
Hauptverfasser:	MacGillivray, Gary, Nasserasr, Shahla, Yang, Feiran
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Discrete Mathematics & Theoretical Computer Science 09.01.2025
Schlagworte:	05c15 computer science - discrete mathematics mathematics - combinatorics
ISSN:	1365-8050, 1365-8050
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!