On connectivities of edge-colored graphs

DOI10.1016/J.DAM.2022.10.008zbMath1504.05102OpenAlexW4308325518MaRDI QIDQ2104926

Kiyoshi Yoshimoto

Publication date: 8 December 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2022.10.008

zbMATH Keywords

edge-colored graphcolor-connectivitycyclic-connectivity

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rainbow \(C_3\)'s and \(C_4\)'s in edge-colored graphs
• Alternating Eulerian trails with prescribed degrees in two edge-colored complete graphs
• Alternating cycles and trails in \(2\)-edge-coloured complete multigraphs
• Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP
• Vertex‐disjoint properly edge‐colored cycles in edge‐colored complete graphs
• A complete bipartite graph without properly colored cycles of length four
• Alternating Hamiltonian cycles in $2$-edge-colored multigraphs
• Digraphs
• Transitiv orientierbare Graphen

This page was built for publication: On connectivities of edge-colored graphs