A generalization of properly colored paths and cycles in edge-colored graphs

DOI10.1016/j.tcs.2022.12.029OpenAlexW4313478211MaRDI QIDQ2682924

Rocío Sánchez-López, Hortensia Galeana-Sánchez, Felipe Hernández-Lorenzana

Publication date: 1 February 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.12.029

zbMATH Keywords

edge-colored graph\(H\)-cycle\(H\)-pathproperly colored walk

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Using matrices to link conflict evolution and resolution in a graph model
• A matrix approach to status quo analysis in the graph model for conflict resolution
• Color degree and alternating cycles in edge-colored graphs
• Alternating cycles in edge-partitioned graphs
• Hamiltonian circuits determining the order of chromosomes
• A note on alternating cycles in edge-coloured graphs
• Alternating cycles and paths in edge-coloured multigraphs: A survey
• Exact approaches for the orderly colored longest path problem: performance comparison
• DNA physical mapping and alternating Eulerian cycles in colored graphs
• Independent restricted domination and the line digraph
• \(H\)-cycles in \(H\)-colored multigraphs
• Some conditions for the existence of Euler \(H\)-trails
• \(H\)-paths and \(H\)-cycles in \(H\)-coloured digraphs
• Restricted domination in arc-colored digraphs
• \(H\)-kernels and \(H\)-obstructions in \(H\)-colored digraphs
• Reachability problems in edge-colored digraphs
• -panchromatic digraphs
• The Orderly Colored Longest Path Problem – a survey of applications and new algorithms
• Digraphs

This page was built for publication: A generalization of properly colored paths and cycles in edge-colored graphs