On a conjecture on directed cycles in a directed bipartite graph (Q1376065): Difference between revisions

@@ Property / author @@
-Kee L. Teo
@@ Property / author: Kee L. Teo / rank @@
-Normal rank
@@ Property / author @@
+Kee L. Teo
@@ Property / author: Kee L. Teo / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q123274064
@@ Property / Wikidata QID: Q123274064 / rank @@
+Normal rank
@@ Property / cites work @@
+Partition of a bipartite Hamiltonian graph into two cycles
+Normal rank
@@ Property / cites work @@
+Covering the vertices of a digraph by cycles of prescribed length
+Normal rank
@@ Property / cites work @@
+A method in graph theory
@@ Property / cites work: A method in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / rank @@
+Normal rank
@@ Property / cites work @@
+On the maximal number of independent circuits in a graph
+Normal rank
@@ Property / cites work @@
+On circuits in graphs
@@ Property / cites work: On circuits in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4858150
@@ Property / cites work: Q4858150 / rank @@
+Normal rank
@@ Property / cites work @@
+Partition of a bipartite graph into cycles
@@ Property / cites work: Partition of a bipartite graph into cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Partition of a directed bipartite graph into two directed cycles
+Normal rank