Decomposing edge-colored graphs under color degree constraints (Q1689962): Difference between revisions

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
Merged Item from Q5222553
 
aliases / en / 0aliases / en / 0
 
Decomposing edge-coloured graphs under colour degree constraints
description / endescription / en
 
scientific article; zbMATH DE number 7186360
Property / title
 
Decomposing edge-coloured graphs under colour degree constraints (English)
Property / title: Decomposing edge-coloured graphs under colour degree constraints (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1436.05037 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1017/S0963548319000014 / rank
 
Normal rank
Property / publication date
 
6 April 2020
Timestamp+2020-04-06T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 6 April 2020 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 7186360 / rank
 
Normal rank
Property / zbMATH Keywords
 
minimum colour degree
Property / zbMATH Keywords: minimum colour degree / rank
 
Normal rank
Property / zbMATH Keywords
 
digraphs
Property / zbMATH Keywords: digraphs / rank
 
Normal rank
Property / published in
 
Property / published in: Combinatorics, Probability and Computing / rank
 
Normal rank

Latest revision as of 09:18, 6 May 2024

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