Decomposing edge-colored graphs under color degree constraints (Q1689962): Difference between revisions
From MaRDI portal
Changed an Item |
Created claim: Wikidata QID (P12): Q128292763, #quickstatements; #temporary_batch_1724739681498 |
||||||||||||||
(4 intermediate revisions by 2 users not shown) | |||||||||||||||
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) | |||||||||||||||
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
| |||||||||||||||
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 | |||||||||||||||
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 | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Color degree and monochromatic degree conditions for short properly colored cycles in edge‐colored graphs / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Transitiv orientierbare Graphen / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Alternating cycles in edge-partitioned graphs / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: A note on alternating cycles in edge-coloured graphs / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / Wikidata QID | |||||||||||||||
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 |
|
Statements
Decomposing edge-colored graphs under color degree constraints (English)
0 references
Decomposing edge-coloured graphs under colour degree constraints (English)
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
0 references