Alternating cycles and trails in 2-edge-coloured complete multigraphs

DOI10.1016/S0012-365X(97)00274-4MaRDI QIDQ1584322zbMATH OpenOpenAlexFDO

Authors G. Gutin, Jørgen Bang-Jensen

Publication date 2 November 2000

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(97)00274-4

zbMATH Keywords

closed alternating trailedge-coloured multigraphsHamiltonian alternating cycle

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Recommendations

• Alternating cycles and paths in edge-coloured multigraphs: A survey
• scientific article; zbMATH DE number 718675
• Alternating Hamiltonian cycles in 2-edge-colored multigraphs
• A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs
• Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results

Cites work

• scientific article; zbMATH DE number 3936534 (Why is no real title available?)
• scientific article; zbMATH DE number 3792219 (Why is no real title available?)
• scientific article; zbMATH DE number 3625415 (Why is no real title available?)
• scientific article; zbMATH DE number 731861 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• scientific article; zbMATH DE number 3249675 (Why is no real title available?)
• scientific article; zbMATH DE number 3257168 (Why is no real title available?)
• Alternating Eulerian trails with prescribed degrees in two edge-colored complete graphs
• Alternating cycles and paths in edge-coloured multigraphs: A survey
• Cycles and paths in bipartite tournaments with spanning configurations
• Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
• Eulerian graphs and related topics. Part 1, Volume 1
• Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP
• Graph theory with applications
• Hamiltonian circuits determining the order of chromosomes

Cited in

(19)

• On connectivities of edge-colored graphs
• Paths and trails in edge-colored graphs
• On \(s\)--\(t\) paths and trails in edge-colored graphs
• Parallel connectivity in edge-colored complete graphs: complexity results
• Fork-forests in bi-colored complete bipartite graphs
• The fine-grained complexity of approximately counting proper connected colorings (extended abstract)
• Cones of closed alternating walks and trails
• Alternating-pancyclism in 2-edge-colored graphs
• Alternating cycles and paths in edge-coloured multigraphs: A survey
• Properly coloured cycles and paths: Results and open problems
• Alternating Hamiltonian cycles in 2-edge-colored multigraphs
• On supereulerian 2-edge-coloured graphs
• Ramsey numbers of trails and circuits
• Euler dynamic H -trails in edge-colored graphs
• Alternating kernels
• Finding paths in graphs avoiding forbidden transitions
• Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles
• Odd properly colored cycles in edge-colored graphs
• A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs

This page was built for publication: Alternating cycles and trails in \(2\)-edge-coloured complete multigraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584322)