Vertex-pancyclism in edge-colored complete graphs with restrictions in color transitions

DOI10.47443/DML.2023.232MaRDI QIDQ6561585FDOQ6561585

Authors: Hortensia Galeana-Sánchez, Felipe Hernández-Lorenzana, Rocio Sanchez-Lopez, Carlos Vilchis-Alfaro 

Publication date: 25 June 2024

Published in: DML. Discrete Mathematics Letters (Search for Journal in Brave)

zbMATH Keywords

edge-colored graphproperly colored cycle\(H\)-cyclevertex \(H\)-panciclicity

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Cites Work

• Pancyclicity and NP-completeness in planar graphs
• Pancyclic graphs. I
• Title not available (Why is that?)
• Digraphs
• Extending cycles in graphs
• Weakly pancyclic graphs
• Title not available (Why is that?)
• A Linear Recognition Algorithm for Cographs
• Title not available (Why is that?)
• Using matrices to link conflict evolution and resolution in a graph model
• Title not available (Why is that?)
• An Eulerian path approach to DNA fragment assembly
• Properly colored paths and cycles
• A matrix-based approach to searching colored paths in a weighted colored multidigraph
• Hamiltonian circuits determining the order of chromosomes
• Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles
• \(H\)-cycles in \(H\)-colored multigraphs
• Some conditions for the existence of Euler \(H\)-trails

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)