\(H\)-cycles in \(H\)-colored multigraphs
From MaRDI portal
Publication:2117527
DOI10.1007/s00373-022-02464-4zbMath1485.05058OpenAlexW4221045572MaRDI QIDQ2117527
Juana Imelda Villarreal-Valdés, Rocío Sánchez-López, Hortensia Galeana-Sánchez, Rocío Rojas-Monroy
Publication date: 21 March 2022
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-022-02464-4
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Properly colored paths and cycles
- 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
- Alternating cycles in edge-partitioned graphs
- A note on alternating cycles in edge-coloured graphs
- Exact approaches for the orderly colored longest path problem: performance comparison
- The Orderly Colored Longest Path Problem – a survey of applications and new algorithms
- Digraphs
This page was built for publication: \(H\)-cycles in \(H\)-colored multigraphs