Publication:4836076
From MaRDI portal
zbMath0826.68064MaRDI QIDQ4836076
No author found.
Publication date: 12 June 1995
Full work available at URL: http://www.numdam.org/item?id=MSH_1994__127__49_0
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C38: Paths and cycles
Related Items
Color degree condition for long rainbow paths in edge-colored graphs, On the (di)graphs with (directed) proper connection number two, Properly colored paths and cycles, Vertex alternating-pancyclism in 2-edge-colored generalized sums of graphs, Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey, Color degree and alternating cycles in edge-colored graphs, Alternating cycles and paths in edge-coloured multigraphs: A survey, Properly coloured Hamiltonian paths in edge-coloured complete graphs, Alternating kernels, A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs, \(H\)-cycles in \(H\)-colored multigraphs, Two sufficient conditions for 2-connected graphs to have proper connection number 2, Optimal proper connection of graphs, The optimal proper connection number of a graph with given independence number, Optimal pathway reconstruction on 3D NMR maps, Note on directed proper connection number of a random graph, Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles, Some conditions for the existence of Euler \(H\)-trails, Minimal colorings for properly colored subgraphs, Alternating-pancyclism in 2-edge-colored graphs, A generalization of properly colored paths and cycles in edge-colored graphs, On s-t paths and trails in edge-colored graphs
