scientific article; zbMATH DE number 762736

MaRDI QIDQ4836076zbMATH OpenFDO

Authors

Publication date 12 June 1995

Full work available at URL http://www.numdam.org/item?id=MSH_1994__127__49_0, https://eudml.org/doc/94457

zbMATH Keywords

alternating pathsedge-coloured pathspaths through specified vertices

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)

Recommendations

• Colorful paths in vertex coloring of graphs
• Paths and trails in edge-colored graphs
• Paths and Trails in Edge-Colored Graphs
• Properly colored paths and cycles in edge colored graphs
• Paths and cycles in colored graphs
• scientific article; zbMATH DE number 2147947
• Colorful paths in vertex coloring of graphs.
• A generalization of properly colored paths and cycles in edge-colored graphs
• Paths and trails in edge-colored weighted graphs
• Cycles and paths in edge‐colored graphs with given degrees

Cited in

(35)

• Paths and trails in edge-colored graphs
• The optimal proper connection number of a graph with given independence number
• Colorful paths in vertex coloring of graphs.
• Minimal colorings for properly colored subgraphs
• A generalization of properly colored paths and cycles in edge-colored graphs
• Alternating kernels
• \(H\)-cycles in \(H\)-colored multigraphs
• Vertex alternating-pancyclism in 2-edge-colored generalized sums of graphs
• Optimal pathway reconstruction on 3D NMR maps
• Note on directed proper connection number of a random graph
• Two sufficient conditions for 2-connected graphs to have proper connection number 2
• Cycles of length 3 and 4 in edge-colored complete graphs with restrictions in the color transitions
• The fine-grained complexity of approximately counting proper connected colorings (extended abstract)
• A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs
• On \(s\)--\(t\) paths and trails in edge-colored graphs
• Proper cycles and rainbow cycles in 2-triangle-free edge-colored complete graphs
• Euler dynamic H -trails in edge-colored graphs
• Properly colored cycles in edge-colored 2-colored-triangle-free complete graphs
• Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles
• scientific article; zbMATH DE number 3889547 (Why is no real title available?)
• Paths through K-specified edges in a linear graph
• Alternating-pancyclism in 2-edge-colored graphs
• Colorful paths in vertex coloring of graphs
• Color degree and alternating cycles in edge-colored graphs
• Alternating cycles and paths in edge-coloured multigraphs: A survey
• Optimal proper connection of graphs
• Properly coloured Hamiltonian paths in edge-coloured complete graphs
• Dynamic cycles in edge-colored multigraphs
• On the (di)graphs with (directed) proper connection number two
• Properly colored paths and cycles
• Some conditions for the existence of Euler \(H\)-trails
• Color degree condition for long rainbow paths in edge-colored graphs
• Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
• Trails in arc-colored digraphs avoiding forbidden transitions
• From colourful to rainbow paths in graphs: colouring the vertices

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4836076)