scientific article; zbMATH DE number 3257168
From MaRDI portal
Publication:5545296
Cited in
(21)- Alternating cycles in edge-partitioned graphs
- Alternating Eulerian trails with prescribed degrees in two edge-colored complete graphs
- On extremal graphs without compatible triangles or quadrilaterals
- Alternating cycles and paths in edge-coloured multigraphs: A survey
- Alternating cycles and trails in \(2\)-edge-coloured complete multigraphs
- Cycles and paths in bipartite tournaments with spanning configurations
- Alternating paths in edge-colored complete graphs
- Properly colored cycles in edge-colored complete graphs without monochromatic triangle: a vertex-pancyclic analogous result
- On supereulerian 2-edge-coloured graphs
- On connectivities of edge-colored graphs
- Proper Hamiltonian cycles in edge-colored multigraphs
- Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP
- scientific article; zbMATH DE number 7641244 (Why is no real title available?)
- On the parallel complexity of the alternating Hamiltonian cycle problem
- Generating all invertible matrices by row operations
- Properly colored \(\overrightarrow{C_4} \)'s in arc-colored complete and complete bipartite digraphs
- Generating all invertible matrices by row operations
- Properly colored spanning trees via subdivision of a given tree in monochromatic triangle-free edge-colored complete graphs
- Properly colored Hamiltonian paths in edge-colored complete bipartite graphs without monochromatic and semi-monochromatic C₄
- Links in edge-colored graphs
- Problems from CGCS Luminy, May 2007
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5545296)
