Alternating-pancyclism in 2-edge-colored graphs
From MaRDI portal
Publication:2656333
DOI10.7151/dmgt.2350OpenAlexW3081896554MaRDI QIDQ2656333
Hortensia Galeana-Sánchez, Narda Cordero-Michel
Publication date: 11 March 2021
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2350
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Properly colored paths and cycles
- A matrix-based approach to searching colored paths in a weighted colored multidigraph
- Vertex alternating-pancyclism in 2-edge-colored generalized sums of graphs
- The minimum reload \(s-t\) path, trail and walk problems
- 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
- Hamiltonian circuits determining the order of chromosomes
- Alternating cycles and paths in edge-coloured multigraphs: A survey
- Alternating cycles and trails in \(2\)-edge-coloured complete multigraphs
- Cycles and paths in bipartite tournaments with spanning configurations
- DNA physical mapping and alternating Eulerian cycles in colored graphs
- A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs
- Digraphs
- Reload cost problems: Minimum diameter spanning tree
This page was built for publication: Alternating-pancyclism in 2-edge-colored graphs