A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs
From MaRDI portal
Publication:2012053
DOI10.1016/J.DAM.2017.04.033zbMATH Open1367.05121OpenAlexW2619613683MaRDI QIDQ2012053FDOQ2012053
Authors: Alejandro Contreras-Balbuena, Hortensia Galeana-Sánchez, Ilan A. Goldfeder 
Publication date: 27 July 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2017.04.033
Recommendations
- Alternating Hamiltonian cycles in 2-edge-colored multigraphs
- Alternating cycles and paths in edge-coloured multigraphs: A survey
- Alternating Hamiltonian cycles
- Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results
- Alternating cycles and trails in \(2\)-edge-coloured complete multigraphs
Cites Work
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- Digraphs
- DNA physical mapping and alternating Eulerian cycles in colored graphs
- Using matrices to link conflict evolution and resolution in a graph model
- Alternating cycles and paths in edge-coloured multigraphs: A survey
- Cycles and paths in edge‐colored graphs with given degrees
- Characterization of edge-colored complete graphs with properly colored Hamilton paths
- Reload cost problems: Minimum diameter spanning tree
- The minimum reload \(s-t\) path, trail and walk problems
- Paths and trails in edge-colored graphs
- A matrix-based approach to searching colored paths in a weighted colored multidigraph
- Properly coloured Hamiltonian cycles in edge-coloured complete graphs
- Acyclicity in edge-colored graphs
- Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP
- An Edge-Colored Version of Dirac's Theorem
- A Dirac type condition for properly coloured paths and cycles
- Chinese postman problem on edge-colored multigraphs
- Title not available (Why is that?)
- Hamiltonian circuits determining the order of chromosomes
- A matrix approach to status quo analysis in the graph model for conflict resolution
- Title not available (Why is that?)
- Alternating Hamiltonian circuits in edge-coloured bipartite graphs
Cited In (11)
- A note on equitable Hamiltonian cycles
- Alternating cycles and trails in \(2\)-edge-coloured complete multigraphs
- Title not available (Why is that?)
- Alternating hamiltonian cycles in two colored complete bipartite graphs
- Title not available (Why is that?)
- Alternating-pancyclism in 2-edge-colored graphs
- Alternating Hamiltonian cycles in 2-edge-colored multigraphs
- On supereulerian 2-edge-coloured graphs
- Vertex alternating-pancyclism in 2-edge-colored generalized sums of graphs
- Title not available (Why is that?)
- The complexity of routing problems in forbidden-transition graphs and edge-colored graphs
This page was built for publication: A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2012053)
