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

← Older edit

@@ aliases / en / 0 / aliases / en / 0 @@
+Decomposing edge-coloured graphs under colour degree constraints
@@ description / en / description / en @@
-scientific article
+scientific article; zbMATH DE number 7186360
@@ Property / title @@
+Decomposing edge-coloured graphs under colour degree constraints (English)
+Normal rank
@@ Property / zbMATH Open document ID @@
+.05037
@@ Property / zbMATH Open document ID: 1436.05037 / rank @@
+Normal rank
@@ Property / DOI @@
+.1017/S0963548319000014
@@ Property / DOI: 10.1017/S0963548319000014 / rank @@
+Normal rank
@@ Property / publication date @@
+April 2020Timestamp +2020-04-06T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2020-04-06T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 6 April 2020 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+7186360
@@ 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 @@
+Combinatorics, Probability and Computing
@@ Property / published in: Combinatorics, Probability and Computing / rank @@
+Normal rank
@@ Property / cites work @@
+Disjoint directed cycles
@@ Property / cites work: Disjoint directed cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Splitting digraphs
@@ Property / cites work: Splitting digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Cycles in digraphs– a survey
@@ Property / cites work: Cycles in digraphs– a survey / rank @@
+Normal rank
@@ Property / cites work @@
+An improved bound for disjoint directed cycles
@@ Property / cites work: An improved bound for disjoint directed cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposing edge-colored graphs under color degree constraints
+Normal rank
@@ Property / cites work @@
+Q4715286
@@ Property / cites work: Q4715286 / rank @@
+Normal rank
@@ Property / cites work @@
+A Relaxed Version of the Erdős–Lovász Tihany Conjecture
+Normal rank
@@ Property / cites work @@
+Nonseparating cycles inK-Connected graphs
@@ Property / cites work: Nonseparating cycles inK-Connected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Disjoint cycles in digraphs
@@ Property / cites work: Disjoint cycles in digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3808121
@@ Property / cites work: Q3808121 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3491608
@@ Property / cites work: Q3491608 / rank @@
+Normal rank
@@ Property / cites work @@
+Color degree and monochromatic degree conditions for short properly colored cycles in edge‐colored graphs
+Normal rank
@@ Property / cites work @@
+Transitiv orientierbare Graphen
@@ Property / cites work: Transitiv orientierbare Graphen / rank @@
+Normal rank
@@ Property / cites work @@
+Alternating cycles in edge-partitioned graphs
@@ Property / cites work: Alternating cycles in edge-partitioned graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A note on alternating cycles in edge-coloured graphs
+Normal rank
@@ Property / Wikidata QID @@
+Q128292763
@@ Property / Wikidata QID: Q128292763 / rank @@
+Normal rank

Latest revision as of 08:26, 27 August 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