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)...

Full description

Saved in:

Bibliographic Details
Published in:	Discrete mathematics and theoretical computer science Vol. 25:2; no. Graph Theory
Main Authors:	MacGillivray, Gary, Nasserasr, Shahla, Yang, Feiran
Format:	Journal Article
Language:	English
Published:	Discrete Mathematics & Theoretical Computer Science 09.01.2025
Subjects:	05c15 computer science - discrete mathematics mathematics - combinatorics
ISSN:	1365-8050, 1365-8050
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!