H-cycles in H-colored multigraphs
From MaRDI portal
Publication:2117527
Recommendations
Cites work
- scientific article; zbMATH DE number 4049453 (Why is no real title available?)
- scientific article; zbMATH DE number 1153462 (Why is no real title available?)
- scientific article; zbMATH DE number 1557065 (Why is no real title available?)
- scientific article; zbMATH DE number 762736 (Why is no real title available?)
- A matrix approach to status quo analysis in the graph model for conflict resolution
- A note on alternating cycles in edge-coloured graphs
- Alternating cycles in edge-partitioned graphs
- Digraphs
- Exact approaches for the orderly colored longest path problem: performance comparison
- Graph theory with applications
- Properly colored paths and cycles
- The orderly colored longest path problem -- a survey of applications and new algorithms
- Using matrices to link conflict evolution and resolution in a graph model
Cited in
(9)- scientific article; zbMATH DE number 6712803 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 5713151 (Why is no real title available?)
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)