Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Lichiardopol, Nicolas
2012.
Vertex-Disjoint Subtournaments of Prescribed Minimum Outdegree or Minimum Semidegree: Proof for Tournaments of a Conjecture of Stiebi.
International Journal of Combinatorics,
Vol. 2012,
Issue. ,
p.
1.
Tonoyan, Tigran
2015.
Conflict graphs and the SINR-capacity of the mean power scheme.
Theoretical Computer Science,
Vol. 608,
Issue. ,
p.
166.
Bang-Jensen, Jørgen
and
Halldórsson, Magnús M.
2015.
Vertex coloring edge-weighted digraphs.
Information Processing Letters,
Vol. 115,
Issue. 10,
p.
791.
Bang-Jensen, J.
and
Havet, Frédéric
2016.
Finding good 2-partitions of digraphs I. Hereditary properties.
Theoretical Computer Science,
Vol. 636,
Issue. ,
p.
85.
Bang-Jensen, J.
Cohen, Nathann
and
Havet, Frédéric
2016.
Finding good 2-partitions of digraphs II. Enumerable properties.
Theoretical Computer Science,
Vol. 640,
Issue. ,
p.
1.
Fujita, Shinya
Li, Ruonan
and
Wang, Guanghui
2017.
Decomposing edge-colored graphs under color degree constraints.
Electronic Notes in Discrete Mathematics,
Vol. 61,
Issue. ,
p.
491.
GIRÃO, ANTÓNIO
KITTIPASSORN, TEERADEJ
and
POPIELARZ, KAMIL
2017.
Generalized Majority Colourings of Digraphs.
Combinatorics, Probability and Computing,
Vol. 26,
Issue. 6,
p.
850.
Yang, Donglei
Bai, Yandong
Wang, Guanghui
and
Wu, Jianliang
2018.
On splitting digraphs.
European Journal of Combinatorics,
Vol. 71,
Issue. ,
p.
174.
Bang-Jensen, J.
Bessy, S.
Havet, F.
and
Yeo, A.
2018.
Out-degree reducing partitions of digraphs.
Theoretical Computer Science,
Vol. 719,
Issue. ,
p.
64.
Bang-Jensen, Jørgen
and
Bessy, Stéphane
2019.
Degree-constrained 2-partitions of graphs.
Theoretical Computer Science,
Vol. 776,
Issue. ,
p.
64.
Bang-Jensen, J.
Knudsen, Kristine V.K.
Saurabh, Saket
and
Zehavi, Meirav
2019.
The parameterized complexity landscape of finding 2-partitions of digraphs.
Theoretical Computer Science,
Vol. 795,
Issue. ,
p.
108.
Bang‐Jensen, J.
Bessy, S.
Havet, F.
and
Yeo, A.
2019.
Bipartite spanning sub(di)graphs induced by 2‐partitions.
Journal of Graph Theory,
Vol. 92,
Issue. 2,
p.
130.
Fujita, Shinya
Li, Ruonan
and
Wang, Guanghui
2019.
Decomposing edge-coloured graphs under colour degree constraints.
Combinatorics, Probability and Computing,
Vol. 28,
Issue. 5,
p.
755.
Alon, Noga
Bang‐Jensen, Jørgen
and
Bessy, Stéphane
2020.
Out‐colourings of digraphs.
Journal of Graph Theory,
Vol. 93,
Issue. 1,
p.
88.
Steiner, Raphael M.
2022.
Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree.
SIAM Journal on Discrete Mathematics,
Vol. 36,
Issue. 2,
p.
1343.
Bang‐Jensen, J.
Havet, F.
Kriesell, M.
and
Yeo, A.
2022.
Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties.
Journal of Graph Theory,
Vol. 99,
Issue. 4,
p.
615.
Song, Chunjiao
and
Yan, Jin
2023.
Partition and Disjoint Cycles in Digraphs.
Graphs and Combinatorics,
Vol. 39,
Issue. 2,
Ji, Qiang
and
Wang, Jihui
2023.
Majority Colorings of Some Special Digraphs.
p.
31.
Steiner, Raphael
2024.
Subdigraphs of prescribed size and out‐degree.
Journal of Graph Theory,
Vol. 105,
Issue. 1,
p.
78.