Hamiltonian circuits determining the order of chromosomes
From MaRDI portal
Publication:1326754
DOI10.1016/0166-218X(92)00171-HzbMath0823.92010WikidataQ126666755 ScholiaQ126666755MaRDI QIDQ1326754
Publication date: 1 November 1995
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
multigraphHamiltonian circuitssimilarity relationadmissible permutationshaploid chromosome complementsmodel of cytogeneticsspatial order
Applications of graph theory (05C90) Paths and cycles (05C38) Biochemistry, molecular biology (92C40) Eulerian and Hamiltonian graphs (05C45)
Related Items (39)
Kernelization of Arc Disjoint Cycle Packing in $$\alpha $$-Bounded Digraphs ⋮ Exact approaches for the orderly colored longest path problem: performance comparison ⋮ Acyclicity in edge-colored graphs ⋮ Paths and trails in edge-colored graphs ⋮ Alternating cycles and paths in edge-coloured multigraphs: A survey ⋮ Alternating-pancyclism in 2-edge-colored graphs ⋮ Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles ⋮ Packing arc-disjoint cycles in tournaments ⋮ Properly coloured Hamiltonian paths in edge-coloured complete graphs ⋮ Two sufficient conditions for 2-connected graphs to have proper connection number 2 ⋮ Kernelization of arc disjoint cycle packing in \(\alpha\)-bounded digraphs ⋮ Proper‐walk connection number of graphs ⋮ Optimal proper connection of graphs ⋮ Hamiltonian Cycle in K1,r-Free Split Graphs — A Dichotomy ⋮ A generalization of properly colored paths and cycles in edge-colored graphs ⋮ Alternating kernels ⋮ 2-Trees: Structural insights and the study of Hamiltonian paths ⋮ Proper cycles and rainbow cycles in 2-triangle-free edge-colored complete graphs ⋮ Properly colored cycles in edge-colored 2-colored-triangle-free complete graphs ⋮ Parallel connectivity in edge-colored complete graphs: complexity results ⋮ On 3-degree 4-chordal graphs ⋮ Hamiltonicity in Split Graphs - A Dichotomy ⋮ The complexity of routing problems in forbidden-transition graphs and edge-colored graphs ⋮ Properly colored paths and cycles ⋮ Unnamed Item ⋮ Symbolic coloured SCC decomposition ⋮ The optimal proper connection number of a graph with given independence number ⋮ A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs ⋮ Note on directed proper connection number of a random graph ⋮ Unnamed Item ⋮ Paths and Trails in Edge-Colored Graphs ⋮ On the (di)graphs with (directed) proper connection number two ⋮ On the (di)graphs with (directed) proper connection number two ⋮ Packing Arc-Disjoint Cycles in Tournaments ⋮ Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles ⋮ Properly Coloured Cycles and Paths: Results and Open Problems ⋮ Vertex alternating-pancyclism in 2-edge-colored generalized sums of graphs ⋮ Color degree and alternating cycles in edge-colored graphs ⋮ Alternating cycles and trails in \(2\)-edge-coloured complete multigraphs
Cites Work
This page was built for publication: Hamiltonian circuits determining the order of chromosomes
