Vertex-pancyclism in edge-colored complete graphs with restrictions in color transitions
From MaRDI portal
Publication:6561585
Recommendations
- On the existence of cycles with restrictions in the color transitions in edge-colored complete graphs
- Cycles of length 3 and 4 in edge-colored complete graphs with restrictions in the color transitions
- Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic paths of length three
- Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles
- Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles
Cites work
- scientific article; zbMATH DE number 3455294 (Why is no real title available?)
- scientific article; zbMATH DE number 3506739 (Why is no real title available?)
- scientific article; zbMATH DE number 1153462 (Why is no real title available?)
- A Linear Recognition Algorithm for Cographs
- A matrix-based approach to searching colored paths in a weighted colored multidigraph
- An Eulerian path approach to DNA fragment assembly
- Digraphs
- Extending cycles in graphs
- Graph theory with applications
- Hamiltonian circuits determining the order of chromosomes
- Pancyclic graphs. I
- Pancyclicity and NP-completeness in planar graphs
- Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles
- Properly colored paths and cycles
- Some conditions for the existence of Euler \(H\)-trails
- Using matrices to link conflict evolution and resolution in a graph model
- Weakly pancyclic graphs
- \(H\)-cycles in \(H\)-colored multigraphs
Cited in
(2)
This page was built for publication: Vertex-pancyclism in edge-colored complete graphs with restrictions in color transitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6561585)
