Rainbow \(C_4\)'s and directed \(C_4\)'s: the bipartite case study

DOI10.1007/s40840-015-0125-1zbMath1332.05079arXiv1301.5697OpenAlexW2952193476MaRDI QIDQ262974

Jun Ge, Bo Ning

Publication date: 4 April 2016

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1301.5697

zbMATH Keywords

edge-colored graphdirected cycleoriented bipartite graphrainbow cycle

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Properly colored and rainbow C4 ${C}_{4}$'s in edge‐colored graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rainbow \(C_3\)'s and \(C_4\)'s in edge-colored graphs
• Color degree and heterochromatic cycles in edge-colored graphs
• Polychromatic Hamilton cycles
• Rainbow matching in edge-colored graphs
• Color neighborhood union conditions for long heterochromatic paths in edge-colored graphs
• Heterochromatic matchings in edge-colored graphs
• Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
• Path and cycle sub-Ramsey numbers and an edge-colouring conjecture
• Multicoloured Hamilton cycles
• A note on heterochromatic \(C_4\) in edge-colored triangle-free graphs
• On the strong rainbow connection of a graph
• Rainbow triangles in edge-colored graphs
• Long heterochromatic paths in edge-colored graphs
• Large Rainbow Matchings in Edge-Coloured Graphs

This page was built for publication: Rainbow \(C_4\)'s and directed \(C_4\)'s: the bipartite case study