scientific article; zbMATH DE number 762736
From MaRDI portal
Publication:4836076
zbMATH Open0826.68064MaRDI QIDQ4836076FDOQ4836076
Authors:
Publication date: 12 June 1995
Full work available at URL: http://www.numdam.org/item?id=MSH_1994__127__49_0
Title of this publication is not available (Why is that?)
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
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)
Cited In (35)
- Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles
- Paths through K-specified edges in a linear graph
- Trails in arc-colored digraphs avoiding forbidden transitions
- 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
- Some conditions for the existence of Euler \(H\)-trails
- \(H\)-cycles in \(H\)-colored multigraphs
- On the (di)graphs with (directed) proper connection number two
- Minimal colorings for properly colored subgraphs
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- Paths and trails in edge-colored graphs
- Two sufficient conditions for 2-connected graphs to have proper connection number 2
- On \(s\)--\(t\) paths and trails in edge-colored graphs
- A generalization of properly colored paths and cycles in edge-colored graphs
- 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)
- Colorful paths in vertex coloring of graphs.
- Properly colored paths and cycles
- Optimal pathway reconstruction on 3D NMR maps
- Note on directed proper connection number of a random graph
- Alternating-pancyclism in 2-edge-colored graphs
- Color degree and alternating cycles in edge-colored graphs
- Color degree condition for long rainbow paths in edge-colored graphs
- Alternating cycles and paths in edge-coloured multigraphs: A survey
- Vertex alternating-pancyclism in 2-edge-colored generalized sums of graphs
- Euler dynamic H -trails in edge-colored graphs
- Dynamic cycles in edge-colored multigraphs
- Alternating kernels
- Optimal proper connection of graphs
- Properly coloured Hamiltonian paths in edge-coloured complete graphs
- The optimal proper connection number of a graph with given independence number
- From colourful to rainbow paths in graphs: colouring the vertices
- Title not available (Why is that?)
- Colorful paths in vertex coloring of graphs
- A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs
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)
