Q6065468 (Q6065468): Difference between revisions

@@ Property / cites work @@
+Paths and trails in edge-colored graphs
@@ Property / cites work: Paths and trails in edge-colored graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest Paths Avoiding Forbidden Subpaths
@@ Property / cites work: Shortest Paths Avoiding Forbidden Subpaths / rank @@
+Normal rank
@@ Property / cites work @@
+The directed 2-linkage problem with length constraints
+Normal rank
@@ Property / cites work @@
+Digraphs
@@ Property / cites work: Digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Separating codes and traffic monitoring
@@ Property / cites work: Separating codes and traffic monitoring / rank @@
+Normal rank
@@ Property / cites work @@
+On minimum connecting transition sets in graphs
@@ Property / cites work: On minimum connecting transition sets in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Directed Disjoint Shortest Paths Problem
@@ Property / cites work: The Directed Disjoint Shortest Paths Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Detours is Fixed-Parameter Tractable
@@ Property / cites work: Finding Detours is Fixed-Parameter Tractable / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
+Normal rank
@@ Property / cites work @@
+A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs
+Normal rank
@@ Property / cites work @@
+Alternating Hamiltonian cycles in $2$-edge-colored multigraphs
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonian circuits determining the order of chromosomes
+Normal rank
@@ Property / cites work @@
+Two-factors in orientated graphs with forbidden transitions
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of multiple-interval graph problems
+Normal rank
@@ Property / cites work @@
+The directed subgraph homeomorphism problem
@@ Property / cites work: The directed subgraph homeomorphism problem / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic Applications of Tree-Cut Width
@@ Property / cites work: Algorithmic Applications of Tree-Cut Width / rank @@
+Normal rank
@@ Property / cites work @@
+The undirected two disjoint shortest paths problem
+Normal rank
@@ Property / cites work @@
+Complexity of trails, paths and circuits in arc-colored digraphs
+Normal rank
@@ Property / cites work @@
+On s-t paths and trails in edge-colored graphs
@@ Property / cites work: On s-t paths and trails in edge-colored graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Alternating cycles in edge-partitioned graphs
@@ Property / cites work: Alternating cycles in edge-partitioned graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Properly Coloured Cycles and Paths: Results and Open Problems
+Normal rank
@@ Property / cites work @@
+Chinese postman problem on edge-colored multigraphs
+Normal rank
@@ Property / cites work @@
+Trees in Graphs with Conflict Edges or Forbidden Transitions
+Normal rank
@@ Property / cites work @@
+Finding Paths in Grids with Forbidden Transitions
@@ Property / cites work: Finding Paths in Grids with Forbidden Transitions / rank @@
+Normal rank
@@ Property / cites work @@
+Two disjoint shortest paths problem with non-negative edge length
+Normal rank
@@ Property / cites work @@
+Q5538410
@@ Property / cites work: Q5538410 / rank @@
+Normal rank
@@ Property / cites work @@
+Cycle extension in edge-colored complete graphs
@@ Property / cites work: Cycle extension in edge-colored complete graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Properly edge-colored theta graphs in edge-colored complete graphs
+Normal rank
@@ Property / cites work @@
+Q3002818
@@ Property / cites work: Q3002818 / rank @@
+Normal rank
@@ Property / cites work @@
+Immersions in Highly Edge Connected Graphs
@@ Property / cites work: Immersions in Highly Edge Connected Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Finding paths in graphs avoiding forbidden transitions
+Normal rank
@@ Property / cites work @@
+The structure of graphs not admitting a fixed immersion
+Normal rank
@@ Property / cites work @@
+A note on alternating cycles in edge-coloured graphs
+Normal rank
@@ Property / cites work @@
+Finding Hamiltonian Cycle in Graphs of Bounded Treewidth
+Normal rank