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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Discrete mathematics and theoretical computer science Ročník 25:2; číslo Graph Theory
Hlavní autori:	MacGillivray, Gary, Nasserasr, Shahla, Yang, Feiran
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Discrete Mathematics & Theoretical Computer Science 09.01.2025
Predmet:	05c15 computer science - discrete mathematics mathematics - combinatorics
ISSN:	1365-8050, 1365-8050
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!