A lower bound on the size of an absorbing set in an arc-coloured tournament (Q1618229): Difference between revisions

@@ Property / DOI @@
-.1016/j.disc.2018.09.013
@@ Property / DOI: 10.1016/j.disc.2018.09.013 / rank @@
-Normal rank
@@ Property / OpenAlex ID @@
+W2964236145
@@ Property / OpenAlex ID: W2964236145 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.08891
@@ Property / arXiv ID: 1708.08891 / rank @@
+Normal rank
@@ Property / cites work @@
+A counterexample to a conjecture on edge-coloured tournaments
+Normal rank
@@ Property / cites work @@
+Absorbing sets in arc-coloured tournaments
@@ Property / cites work: Absorbing sets in arc-coloured tournaments / rank @@
+Normal rank
@@ Property / cites work @@
+On monochromatic paths in m-coloured tournaments
@@ Property / cites work: On monochromatic paths in m-coloured tournaments / rank @@
+Normal rank
@@ Property / cites work @@
+Domination in transitive colorings of tournaments
@@ Property / cites work: Domination in transitive colorings of tournaments / rank @@
+Normal rank
@@ Property / cites work @@
+On monochromatic paths in edge-coloured digraphs
@@ Property / cites work: On monochromatic paths in edge-coloured digraphs / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q129126607
@@ Property / Wikidata QID: Q129126607 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.DISC.2018.09.013
@@ Property / DOI: 10.1016/J.DISC.2018.09.013 / rank @@
+Normal rank