Pages that link to "Item:Q1902468"
From MaRDI portal
The following pages link to DNA physical mapping and alternating Eulerian cycles in colored graphs (Q1902468):
Displayed 30 items.
- Mathematical programming approaches for classes of random network problems (Q319592) (← links)
- Sufficient conditions for the existence of spanning colored trees in edge-colored graphs (Q442397) (← links)
- Binary matroids and local complementation (Q482118) (← links)
- The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles (Q497683) (← links)
- Chinese postman problem on edge-colored multigraphs (Q516812) (← links)
- The interlace polynomial of a graph (Q705880) (← links)
- Vertex alternating-pancyclism in 2-edge-colored generalized sums of graphs (Q777393) (← links)
- Some algorithmic results for finding compatible spanning circuits in edge-colored graphs (Q830935) (← links)
- Finite automata for testing composition-based reconstructibility of sequences (Q931728) (← links)
- Links in edge-colored graphs (Q966157) (← links)
- Graph traversals, genes and matroids: An efficient case of the travelling salesman problem (Q1281769) (← links)
- Euler circuits and DNA sequencing by hybridization (Q1585320) (← links)
- Gene assembly through cyclic graph decomposition (Q1605478) (← links)
- Exact approaches for the orderly colored longest path problem: performance comparison (Q1628069) (← links)
- Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems (Q1752690) (← links)
- A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs (Q2012053) (← links)
- Some conditions for the existence of Euler \(H\)-trails (Q2334082) (← links)
- Acyclicity in edge-colored graphs (Q2374151) (← links)
- Paths and trails in edge-colored graphs (Q2378531) (← links)
- Characterizing the reconstruction and enumerating the patterns of DNA sequences with re\-peats (Q2471049) (← links)
- Alternating-pancyclism in 2-edge-colored graphs (Q2656333) (← links)
- A generalization of properly colored paths and cycles in edge-colored graphs (Q2682924) (← links)
- Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs (Q2687939) (← links)
- On s-t paths and trails in edge-colored graphs (Q2840541) (← links)
- Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three (Q2960471) (← links)
- Cycles and paths in edge‐colored graphs with given degrees (Q3055905) (← links)
- A BRACKET POLYNOMIAL FOR GRAPHS, IV: UNDIRECTED EULER CIRCUITS, GRAPH-LINKS AND MULTIPLY MARKED GRAPHS (Q3173279) (← links)
- A BRACKET POLYNOMIAL FOR GRAPHS, II: LINKS, EULER CIRCUITS AND MARKED GRAPHS (Q3560276) (← links)
- Hidden Hamiltonian Cycle Recovery via Linear Programming (Q5130484) (← links)
- Shuffling biological sequences (Q5961624) (← links)