Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP (Q4715273): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Cycles in bipartite tournaments
@@ Property / cites work: Cycles in bipartite tournaments / rank @@
+Normal rank
@@ Property / cites work @@
+Q5545296
@@ Property / cites work: Q5545296 / rank @@
+Normal rank
@@ Property / cites work @@
+Alternating Hamiltonian cycles
@@ Property / cites work: Alternating Hamiltonian cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Symmetric designs and geometroids
@@ Property / cites work: Symmetric designs and geometroids / rank @@
+Normal rank
@@ Property / cites work @@
+Hamilton circuits with many colours in properly edge-coloured complete graphs.
+Normal rank
@@ Property / cites work @@
+Graphs with Hamiltonian cycles having adjacent lines different colours
+Normal rank
@@ Property / cites work @@
+Constructing a perfect matching is in random NC
@@ Property / cites work: Constructing a perfect matching is in random NC / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1017/s0963548300002054
+Normal rank
@@ Property / OpenAlex ID @@
+W2085072166
@@ Property / OpenAlex ID: W2085072166 / rank @@
+Normal rank