Properly colored paths and cycles
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2131198 (Why is no real title available?)
- scientific article; zbMATH DE number 4049453 (Why is no real title available?)
- scientific article; zbMATH DE number 762736 (Why is no real title available?)
- scientific article; zbMATH DE number 5237337 (Why is no real title available?)
- Alternating cycles and paths in edge-coloured multigraphs: A survey
- Color degree and alternating cycles in edge-colored graphs
- Digraphs
- Hamiltonian circuits determining the order of chromosomes
- On rainbow connection
- Rainbow connection in graphs
- Some Theorems on Abstract Graphs
Cited in
(42)- 2-factor of edge colored graph
- A classification of edge-colored graphs based on properly colored walks
- Note on rainbow cycles in edge-colored graphs
- Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles
- Some algorithmic results for finding compatible spanning circuits in edge-colored graphs
- Trails in arc-colored digraphs avoiding forbidden transitions
- Vertex-pancyclism in edge-colored complete graphs with restrictions in color transitions
- Properly colored paths and cycles in edge colored graphs
- Properly edge-colored theta graphs in edge-colored complete graphs
- The edge-recoloring cost of paths and cycles in edge-colored graphs and digraphs
- Properly coloured Hamiltonian cycles in edge-coloured complete graphs
- Sufficient conditions for properly colored \(C_3\)'s and \(C_4\)'s in edge-colored complete graphs
- On the existence of cycles with restrictions in the color transitions in edge-colored complete graphs
- 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
- A Dirac type condition for properly coloured paths and cycles
- \(H\)-cycles in \(H\)-colored multigraphs
- Exact approaches for the orderly colored longest path problem: performance comparison
- Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic paths of length three
- Acyclicity in edge-colored graphs
- A generalization of properly colored paths and cycles in edge-colored graphs
- Monochromatic-degree conditions for properly colored cycles in edge-colored complete graphs
- Cycles of length 3 and 4 in edge-colored complete graphs with restrictions in the color transitions
- Compatible spanning circuits in edge-colored graphs
- Acyclic digraphs
- Alternating-pancyclism in 2-edge-colored graphs
- Properly coloured cycles and paths: Results and open problems
- Proper connection of graphs
- Minimum <scp>color‐degree</scp> perfect b‐matchings
- Vertex alternating-pancyclism in 2-edge-colored generalized sums of graphs
- Color neighborhood union conditions for proper edge-pancyclicity of edge-colored complete graphs
- Cycle extension in edge-colored complete graphs
- Long properly coloured cycles in edge-coloured graphs
- Properly colored spanning trees in edge-colored graphs
- Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles
- Odd properly colored cycles in edge-colored graphs
- Graphs with (strong) proper connection numbers \(m - 3\) and \(m - 4\)
- Chinese postman problem on edge-colored multigraphs
- Maximum properly colored trees in edge-colored graphs
- Properly colored cycles in edge-colored complete graphs without monochromatic triangle: a vertex-pancyclic analogous result
- Long properly colored cycles in edge colored complete graphs
- Note on rainbow triangles in edge-colored graphs
This page was built for publication: Properly colored paths and cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q642961)
