H-cycles in H-colored multigraphs
From MaRDI portal
Publication:2117527
DOI10.1007/S00373-022-02464-4zbMATH Open1485.05058OpenAlexW4221045572MaRDI QIDQ2117527FDOQ2117527
Juana Imelda Villarreal-Valdés, Rocio Sanchez-Lopez, 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
Cites Work
- Title not available (Why is that?)
- Digraphs
- Title not available (Why is that?)
- Alternating cycles in edge-partitioned graphs
- A note on alternating cycles in edge-coloured graphs
- Title not available (Why is that?)
- Using matrices to link conflict evolution and resolution in a graph model
- Properly colored paths and cycles
- The Orderly Colored Longest Path Problem – a survey of applications and new algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- A matrix approach to status quo analysis in the graph model for conflict resolution
- Exact approaches for the orderly colored longest path problem: performance comparison
Cited In (9)
- Title not available (Why is that?)
- Trails in arc-colored digraphs avoiding forbidden transitions
- Vertex-pancyclism in edge-colored complete graphs with restrictions in color transitions
- On the existence of cycles with restrictions in the color transitions in edge-colored complete graphs
- Some conditions for the existence of Euler \(H\)-trails
- A generalization of properly colored paths and cycles in edge-colored graphs
- Cycles of length 3 and 4 in edge-colored complete graphs with restrictions in the color transitions
- Dynamic cycles in edge-colored multigraphs
- Title not available (Why is that?)
This page was built for publication: \(H\)-cycles in \(H\)-colored multigraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117527)
