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

From MaRDI portal
Merged Item from Q5222553
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Disjoint directed cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles in digraphs– a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved bound for disjoint directed cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing edge-colored graphs under color degree constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4715286 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Relaxed Version of the Erdős–Lovász Tihany Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonseparating cycles inK-Connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint cycles in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3808121 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491608 / rank
 
Normal rank

Revision as of 00:16, 15 July 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
18 January 2018
0 references
6 April 2020
0 references
Bermond-Thomassen conjecture
0 references
edge-colored graph
0 references
vertex partition
0 references
minimum colour degree
0 references
digraphs
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references