On connectivities of edge-colored graphs
From MaRDI portal
Publication:2104926
Recommendations
Cites work
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- scientific article; zbMATH DE number 3257168 (Why is no real title available?)
- A complete bipartite graph without properly colored cycles of length four
- Alternating Eulerian trails with prescribed degrees in two edge-colored complete graphs
- Alternating Hamiltonian cycles in 2-edge-colored multigraphs
- Alternating cycles and trails in \(2\)-edge-coloured complete multigraphs
- Digraphs
- Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP
- Graph theory
- Rainbow \(C_3\)'s and \(C_4\)'s in edge-colored graphs
- Transitiv orientierbare Graphen
- Vertex-disjoint properly edge-colored cycles in edge-colored complete graphs
Cited in
(6)- A classification of edge-colored graphs based on properly colored walks
- scientific article; zbMATH DE number 5203325 (Why is no real title available?)
- A generalization of an edge-connectivity theorem of Chartrand
- scientific article; zbMATH DE number 2097434 (Why is no real title available?)
- Reachability problems in edge-colored digraphs
- scientific article; zbMATH DE number 3855142 (Why is no real title available?)
This page was built for publication: On connectivities of edge-colored graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104926)