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

DOI10.1016/J.DAM.2017.04.033MaRDI QIDQ2012053zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

Hamiltonian cyclesalternating Hamiltonian cyclesedge-colored multigraphs

Mathematics Subject Classification ID

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

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

• scientific article; zbMATH DE number 762736 (Why is no real title available?)
• scientific article; zbMATH DE number 7696309 (Why is no real title available?)
• A Dirac type condition for properly coloured paths and cycles
• A matrix approach to status quo analysis in the graph model for conflict resolution
• A matrix-based approach to searching colored paths in a weighted colored multidigraph
• Acyclicity in edge-colored graphs
• Alternating Hamiltonian circuits in edge-coloured bipartite graphs
• Alternating cycles and paths in edge-coloured multigraphs: A survey
• An Edge-Colored Version of Dirac's Theorem
• Characterization of edge-colored complete graphs with properly colored Hamilton paths
• Chinese postman problem on edge-colored multigraphs
• Cycles and paths in edge‐colored graphs with given degrees
• DNA physical mapping and alternating Eulerian cycles in colored graphs
• Digraphs
• Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP
• Hamiltonian circuits determining the order of chromosomes
• Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
• Paths and trails in edge-colored graphs
• Properly coloured Hamiltonian cycles in edge-coloured complete graphs
• Reload cost problems: Minimum diameter spanning tree
• The minimum reload \(s-t\) path, trail and walk problems
• Using matrices to link conflict evolution and resolution in a graph model

Cited in

(11)

• A note on equitable Hamiltonian cycles
• Alternating cycles and trails in \(2\)-edge-coloured complete multigraphs
• Alternating hamiltonian cycles in two colored complete bipartite graphs
• scientific article; zbMATH DE number 7765417 (Why is no real title available?)
• scientific article; zbMATH DE number 139939 (Why is no real title available?)
• 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
• scientific article; zbMATH DE number 7641244 (Why is no real title available?)
• 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)