Vertex-pancyclism in edge-colored complete graphs with restrictions in color transitions
From MaRDI portal
Publication:6561585
DOI10.47443/DML.2023.232MaRDI QIDQ6561585
Rocio Sanchez-Lopez, Felipe Hernández-Lorenzana, Hortensia Galeana-Sánchez, Carlos Vilchis-Alfaro
Publication date: 25 June 2024
Published in: DML. Discrete Mathematics Letters (Search for Journal in Brave)
Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Properly colored paths and cycles
- A matrix-based approach to searching colored paths in a weighted colored multidigraph
- Extending cycles in graphs
- Using matrices to link conflict evolution and resolution in a graph model
- Hamiltonian circuits determining the order of chromosomes
- Pancyclicity and NP-completeness in planar graphs
- \(H\)-cycles in \(H\)-colored multigraphs
- Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles
- Some conditions for the existence of Euler \(H\)-trails
- Pancyclic graphs. I
- A Linear Recognition Algorithm for Cographs
- Weakly pancyclic graphs
- An Eulerian path approach to DNA fragment assembly
- Digraphs
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)