Pages that link to "Item:Q1326754"
From MaRDI portal
The following pages link to Hamiltonian circuits determining the order of chromosomes (Q1326754):
Displaying 49 items.
- Properly colored paths and cycles (Q642961) (← links)
- Vertex alternating-pancyclism in 2-edge-colored generalized sums of graphs (Q777393) (← links)
- Color degree and alternating cycles in edge-colored graphs (Q1043956) (← links)
- Alternating cycles and paths in edge-coloured multigraphs: A survey (Q1356728) (← links)
- Properly coloured Hamiltonian paths in edge-coloured complete graphs (Q1383382) (← links)
- Alternating cycles and trails in \(2\)-edge-coloured complete multigraphs (Q1584322) (← links)
- Exact approaches for the orderly colored longest path problem: performance comparison (Q1628069) (← links)
- Alternating kernels (Q1693142) (← links)
- A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs (Q2012053) (← links)
- Two sufficient conditions for 2-connected graphs to have proper connection number 2 (Q2186294) (← links)
- Optimal proper connection of graphs (Q2192984) (← links)
- Symbolic coloured SCC decomposition (Q2233494) (← links)
- The optimal proper connection number of a graph with given independence number (Q2234746) (← links)
- Note on directed proper connection number of a random graph (Q2279590) (← links)
- Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles (Q2312662) (← links)
- Acyclicity in edge-colored graphs (Q2374151) (← links)
- Paths and trails in edge-colored graphs (Q2378531) (← links)
- Alternating-pancyclism in 2-edge-colored graphs (Q2656333) (← links)
- Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles (Q2656965) (← links)
- Packing arc-disjoint cycles in tournaments (Q2663711) (← links)
- A generalization of properly colored paths and cycles in edge-colored graphs (Q2682924) (← links)
- The complexity of routing problems in forbidden-transition graphs and edge-colored graphs (Q2701383) (← links)
- Hamiltonicity in Split Graphs - A Dichotomy (Q2971662) (← links)
- Properly Coloured Cycles and Paths: Results and Open Problems (Q3655153) (← links)
- (Q4436792) (← links)
- Kernelization of Arc Disjoint Cycle Packing in $$\alpha $$-Bounded Digraphs (Q5042259) (← links)
- Packing Arc-Disjoint Cycles in Tournaments (Q5092386) (← links)
- (Q5094123) (← links)
- Paths and Trails in Edge-Colored Graphs (Q5458574) (← links)
- On the (di)graphs with (directed) proper connection number two (Q5918844) (← links)
- On the (di)graphs with (directed) proper connection number two (Q5920180) (← links)
- Kernelization of arc disjoint cycle packing in \(\alpha\)-bounded digraphs (Q6038707) (← links)
- Proper‐walk connection number of graphs (Q6055386) (← links)
- (Q6065468) (← links)
- Hamiltonian Cycle in K1,r-Free Split Graphs — A Dichotomy (Q6114853) (← links)
- 2-Trees: Structural insights and the study of Hamiltonian paths (Q6132868) (← links)
- Proper cycles and rainbow cycles in 2-triangle-free edge-colored complete graphs (Q6143690) (← links)
- Properly colored cycles in edge-colored 2-colored-triangle-free complete graphs (Q6145817) (← links)
- Parallel connectivity in edge-colored complete graphs: complexity results (Q6154375) (← links)
- On 3-degree 4-chordal graphs (Q6174132) (← links)
- Valid inequalities for the \(k\)-color shortest path problem (Q6554645) (← links)
- Trails in arc-colored digraphs avoiding forbidden transitions (Q6561576) (← links)
- Vertex-pancyclism in edge-colored complete graphs with restrictions in color transitions (Q6561585) (← links)
- On the existence of cycles with restrictions in the color transitions in edge-colored complete graphs (Q6564830) (← links)
- On the parallel complexity of the alternating Hamiltonian cycle problem (Q6567696) (← links)
- Cycles of length 3 and 4 in edge-colored complete graphs with restrictions in the color transitions (Q6602386) (← links)
- A closer look at Hamiltonicity and domination through the lens of diameter and convexity (Q6634506) (← links)
- Euler dynamic <i>H</i> -trails in edge-colored graphs (Q6651158) (← links)
- Dynamic cycles in edge-colored multigraphs (Q6660053) (← links)