Decomposing edge-colored graphs under color degree constraints (Q1689962)

From MaRDI portal
scientific article; zbMATH DE number 7186360
  • Decomposing edge-coloured graphs under colour degree constraints
Language Label Description Also known as
English
Decomposing edge-colored graphs under color degree constraints
scientific article; zbMATH DE number 7186360
  • Decomposing edge-coloured graphs under colour degree constraints

Statements

Decomposing edge-colored graphs under color degree constraints (English)
0 references
Decomposing edge-coloured graphs under colour degree constraints (English)
0 references
0 references
0 references
0 references
0 references
0 references
18 January 2018
0 references
6 April 2020
0 references
0 references
0 references
0 references
0 references
0 references
0 references
Bermond-Thomassen conjecture
0 references
edge-colored graph
0 references
vertex partition
0 references
minimum colour degree
0 references
digraphs
0 references
0 references
0 references