A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs

DOI10.1016/j.dam.2017.04.033zbMath1367.05121OpenAlexW2619613683MaRDI QIDQ2012053

Ilan A. Goldfeder, Hortensia Galeana-Sánchez, Alejandro Contreras-Balbuena

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

zbMATH Keywords

Hamiltonian cyclesalternating Hamiltonian cyclesedge-colored multigraphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)

Related Items (7)

Alternating-pancyclism in 2-edge-colored graphs ⋮ The complexity of routing problems in forbidden-transition graphs and edge-colored graphs ⋮ Unnamed Item ⋮ A note on equitable Hamiltonian cycles ⋮ Unnamed Item ⋮ On supereulerian 2-edge-coloured graphs ⋮ Vertex alternating-pancyclism in 2-edge-colored generalized sums of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Chinese postman problem on edge-colored multigraphs
• A matrix-based approach to searching colored paths in a weighted colored multidigraph
• The minimum reload \(s-t\) path, trail and walk problems
• Using matrices to link conflict evolution and resolution in a graph model
• Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
• A matrix approach to status quo analysis in the graph model for conflict resolution
• Alternating Hamiltonian circuits in edge-coloured bipartite graphs
• Hamiltonian circuits determining the order of chromosomes
• Alternating cycles and paths in edge-coloured multigraphs: A survey
• Properly coloured Hamiltonian cycles in edge-coloured complete graphs
• DNA physical mapping and alternating Eulerian cycles in colored graphs
• Acyclicity in edge-colored graphs
• Paths and trails in edge-colored graphs
• Cycles and paths in edge‐colored graphs with given degrees
• Characterization of edge-colored complete graphs with properly colored Hamilton paths
• 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
• Digraphs
• Reload cost problems: Minimum diameter spanning tree

This page was built for publication: A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs