scientific article
From MaRDI portal
Publication:3786318
zbMath0643.92012MaRDI QIDQ3786318
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hamiltonian pathcomputer algorithmadmissible permutationscharacterisation theorembicoloured nonoriented graphM. D. Bennett's model of chromosome ordersubset of non-admissible permutations
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Genetics and epigenetics (92D10)
Related Items (18)
Hamiltonian circuits determining the order of chromosomes ⋮ 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 ⋮ Properly coloured Hamiltonian paths in edge-coloured complete graphs ⋮ Two sufficient conditions for 2-connected graphs to have proper connection number 2 ⋮ Parallel connectivity in edge-colored complete graphs: complexity results ⋮ Properly colored paths and cycles ⋮ Note on directed proper connection number of a random graph ⋮ Paths and Trails in Edge-Colored Graphs ⋮ On the (di)graphs with (directed) proper connection number two ⋮ Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles ⋮ Vertex alternating-pancyclism in 2-edge-colored generalized sums of graphs ⋮ Color degree and alternating cycles in edge-colored graphs ⋮ Some conditions for the existence of Euler \(H\)-trails ⋮ \(H\)-cycles in \(H\)-colored multigraphs
This page was built for publication:
