Alternating cycles and trails in 2-edge-coloured complete multigraphs
From MaRDI portal
Publication:1584322
DOI10.1016/S0012-365X(97)00274-4zbMATH Open0956.05040OpenAlexW2143472568MaRDI QIDQ1584322FDOQ1584322
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
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
- Title not available (Why is that?)
- Cycles and paths in bipartite tournaments with spanning configurations
- Graph theory with applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Eulerian graphs and related topics. Part 1, Volume 1
- Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
- Alternating cycles and paths in edge-coloured multigraphs: A survey
- Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP
- Title not available (Why is that?)
- Hamiltonian circuits determining the order of chromosomes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Alternating Eulerian trails with prescribed degrees in two edge-colored complete graphs
Cited In (19)
- On connectivities of edge-colored graphs
- Parallel connectivity in edge-colored complete graphs: complexity results
- Paths and trails in edge-colored graphs
- On \(s\)--\(t\) paths and trails in edge-colored graphs
- 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
- Properly coloured cycles and paths: Results and open problems
- Alternating cycles and paths in edge-coloured multigraphs: A survey
- 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
- Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles
- Finding paths in graphs avoiding forbidden transitions
- 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)
